199 search results - page 11 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
SIAMCOMP
2010
13 years 7 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
FOCS
1997
IEEE
14 years 25 days ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
ANTS
2004
Springer
14 years 2 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
ENTCS
2000
13 years 8 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
COMPGEOM
1996
ACM
14 years 23 days ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...