Counting complexity classes for numeric computations I: Semilinear sets

SIAM Journal on Computing

Volumn 33, Issue 1, 2003, Pages 227-260

  Bürgisser, Peter ^a   Cucker, Felipe ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Betti numbers; Counting complexity; Euler characteristic; Real complexity classes

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; DIGITAL CIRCUITS; NUMERICAL METHODS; SET THEORY; THEOREM PROVING; TOPOLOGY; TURING MACHINES;

ADDITIVE CIRCUIT; BETTI NUMBERS; COUNTING COMPLEXITY; EULER CHARACTERISTICS; NUMERIC COMPUTATIONS; REAL COMPLEXITY CLASSES; SEMILINEAR SETS; TOPOLOGICAL INVARIANTS;

COMPUTATIONAL COMPLEXITY;

EID: 12144287888     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702415950     Document Type: Article

References (45)

1. J. Balcázar, A. Lozano, and J. Torán, The complexity of algorithmic problem on succinct instances, in Computer Science: Research and Applications, Plenum Press, New York, 1992, pp. 351-377.
2. J. L. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I, Springer-Verlag, Berlin, 1988.
3. M. Ben-Or, Lower bounds for algebraic computation trees, in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA, 1983, pp. 80-86.
4. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1998.
5. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers, Bull. Amer. Math. Soc. (N.S.), 21 (1989), pp. 1-46.
6. A. Borodin, On relating time and space to size and depth, SIAM J. Comput., 6 (1977), pp. 733-744.
7. P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory, Algorithms Comput. Math. 7, Springer-Verlag, Berlin, 2000.
8. P. Bürgisser, Cook's versus Valiant's hypothesis, Theoret. Comput. Sci., 235 (2000), pp. 71-88.
9. P. Bürgisser, Lower bounds and real algebraic geometry, in Algorithmic and Quantitative Real Algebraic Geometry, S. Basu and L. Gonzales-Vega, eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 60, AMS, Providence, RI, 2003, pp. 35-54.
10. P. Bürgisser, M. Clausen, and M. Shokrollahi, Algebraic Complexity Theory, Grundlehren Math. Wiss. 315, Springer-Verlag, Berlin, 1997.
11. P. Bürgisser and F. Cucker, Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets, manuscript.
12. F. Cucker and D. Grigoriev, On the power of real Turing machines over binary inputs, SIAM J. Comput., 26 (1997), pp. 243-254.
13. F. Cucker, M. Karpinski, P. Koiran, T. Lickteig, and K. Werther, On real Turing machines that toss coins, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 335-342.
14. F. Cucker and P. Koiran, Computing over the reals with addition and order: Higher complexity classes, J. Complexity, 11 (1995), pp. 358-376.
15. F. Cucker and M. Matamala, On digital nondeterminism, Math. Systems Theory, 29 (1996), pp. 635-647.
16. H. Fournier and P. Koiran, Are lower bounds easier over the reals?, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 507-513.
17. H. Fournier and P. Koiran, Lower bounds are not easier over the reals: Inside PH, in Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, Geneva, Switzerland, 2000, Lecture Notes in Comput. Sci. 1853, Springer-Verlag, Berlin, 2000, pp. 832-843.
18. H. Galperin and A. Wigderson, Succinct representation of graphs, Inform. and Control, 56 (1983), pp. 183-198.
19. J. v. z. Gathen, Parallel arithmetic computations: A survey, in Proceedings of the 12th Annual Symposium on Mathematical Foundations of Computer Science, Bratislava, Czechoslovakia, 1986, Lecture Notes in Comput. Sci. 233, J. Gruska, B. Rovan, and J. Wiedermann, eds., Springer-Verlag, Berlin, 1986, pp. 93-112.
20. A. Hatcher, Algebraic Topology, Cambridge University Press, Cambridge, UK, 2002.
21. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
22. L. Khachijan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR, 244 (1979), pp. 1093-1096 (in Russian); Soviet Math. Dokl., 20 (1979), pp. 191-194 (in English).
23. K.-I. Ko, Complexity of Real Functions, Birkhäuser Boston, Boston, 1991.
24. P. Koiran, Computing over the reals with addition and order, Theoret. Comput. Sci., 133 (1994), pp. 35-47.
25. P. Koiran, A weak version of the Blum, Shub, and Smale model, J. Comput. System Sci., 54 (1997), pp. 177-189.
26. H. Lewis and C. Papadimitriou, Symmetric space-bounded computation, Theoret. Comput. Sci., 19 (1982), pp. 161-187.
27. K. Meer, Counting problems over the reals, Theoret. Comput. Sci., 242 (2000), pp. 41-58.
28. S. Meiser, Point location in arrangements of hyperplanes, Inform. and Comput., 106 (1993), pp. 286-303.
29. F. Meyer auf der Heide, A polynomial linear search algorithm for the n-dimensional knapsack problem, J. Assoc. Comput. Mach., 31 (1984), pp. 668-676.
30. F. Meyer auf der Heide, Fast algorithms for n-dimensional restrictions of hard problems, J. Assoc. Comput. Mach., 35 (1988), pp. 740-747.
31. C. Michaux, Une remarque à propos des machines sur ℝ introduites par Blum, Shub et Smale, C. R. Acad. Sci. Paris Sér I Math., 309 (1989), pp. 435-437.
32. K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, 7 (1987), pp. 101-104.
33. J. R. Munkres, Elements of Algebraic Topology, Addison-Wesley, Menlo Park, CA, 1984.
34. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
35. J. Reif, Complexity of the mover's problem and generalizations, in Proceedings of the 20th Annual Symposium on Foundations of Computer Science, San Juan, PR, 1979, pp. 421-427.
36. J. Reif, Complexity of the generalized mover's problem, in Planning, Geometry and Complexity of Robot Motion, J. Schwartz, M. Sharir, and J. Hopcroft, eds., Ablex Publishing Corporation, Norwood, NJ, 1987, pp. 267-281.
37. E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res., 34 (1986), pp. 250-256.
38. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput., 20 (1991), pp. 865-877.
39. S. Toda and O. Watanabe, Polynomial time 1-Turing reductions from #PH to #P, Theoret. Comput. Sci., 100 (1992), pp. 205-221.
40. L. Valiant, Completeness classes in algebra, in Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1979, pp. 249-261.
41. L. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.
42. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
43. L. Valiant, Reducibility by algebraic projections, in Logic and Algorithmic: An International Symposium Held in Honor of Ernst Specker, Monograph. Enseign. Math. 30, 1982, pp. 365-380.
44. A. Yao, Algebraic decision trees and Euler characteristics, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 268-277.
45. A. Yao, Decision tree complexity and Betti numbers, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, QC, Canada, 1994, pp. 615-624.