The complexity of semilinear problems in succinct representation

Computational Complexity

Volumn 15, Issue 3, 2006, Pages 197-235

  Bürgisser, Peter ^a   Cucker, Felipe ^b   De Naurois, Paulin Jacobé ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c LORIA   (France)

Author keywords

BSS additive model; Complete problems; Semilinear sets

Indexed keywords

EID: 33751051746     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-006-0213-6     Document Type: Article

References (40)

1. S. I. ADIAN (1957). Unsolvability of certain algorithmic problems in the theory of groups. Trudy Moskov. Mat. Obshch. 6, 231-298 (in Russian).
2. E. H. BAREISS (1968). Sylvester's identity and multistep integer-preserving Gaussian elimination. Math. Comp. 22, 565-578.
3. L. BLUM, F. CUCKER, M. SHUB & S. SMALE (1998). Complexity and Real Computation. Springer.
4. K. H. BORGWARDT (1982). The average number of pivot steps required by the simplex method is polynomial. Oper. Res. 26, 157-177.
5. P. BÜRGISSER & F. CUCKER (2003). Counting complexity classes for numeric computations I: semilinear sets. SIAM J. Comput. 33, 227-260.
6. S. BUSS & L. HAY (1991). On truth-table reducibility to SAT. Inform. Comput. 91, 86-102.
7. A. CHANDRA, L. STOCKMEYER & U. VISHKIN (1984). Constant depth reducibility. SIAM J. Comput. 13, 423-439.
8. D. CHEUNG, F. CUCKER & Y. YE (2003). Linear programming and condition numbers under the real number computation model. In Handbook of Numerical Analysis, Vol. XI, North-Holland, Amsterdam, 141-207.
9. F. CUCKER & P. KOIRAN (1995). Computing over the reals with addition and order: Higher complexity classes. J. Complexity 11, 358-376.
10. F. CUCKER & M. MATAMALA (1996). On digital nondeterminism. Math. Systems Theory 29, 635-647.
11. G.B. DANTZIG & B. G. EAVES (1973). Fourier-Motzkin elimination and its dual. J. Combin. Theory Ser. A 14, 288-297.
12. T. K. DEY, H. EDELSBRUNNER & S. GUHA (1999). Computational topology. In Advances in Discrete and Computational Geometry (South Hadley, MA, 1996), Contemp. Math. 223, Amer. Math. Soc., Providence, RI, 109-143.
13. J. FERRANTE & G. W. RACKOFF (1979). The Computational Complexity of Logical Theories. Lecture Notes in Comput. Sci. 718, Springer.
14. H. FOURNIER & P. KOIRAN (1998). Are lower bounds easier over the reals? In Proc. 30th Annual ACM Symposium on the Theory of Computing (Dallas, TX), 507-513.
15. H. FOURNIER & P. KOIRAN (2000). Lower bounds are not easier over the reals: Inside PH. In Proc. 27th International Colloquim on Automata, Language and Programming ICALP 2000 (Geneva), Lecture Notes in Comput. Sci. 1853, Springer, 832-843.
16. A. HATCHER (2002). Algebraic Topology. Cambridge Univ. Press, Cambridge.
17. L. HEMACHANDRA (1989). The strong exponential hierarchy collapses. J. Comput. System Sci. 39, 299-322.
18. E. HEMASPAANDRA, L. A. HEMASPAANDRA & J. ROTHE (1997). Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM 44, 806-825.
19. E. KALTOFEN, M.S. KRISHNAMOORTHY & B. D. SAUNDERS (1987). Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. Algebraic Discrete Methods 4, 683-690.
20. R. KANNAN & A. BACHEM (1979). Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. 8, 499-507.
21. L. KHACHIJAN (1979). A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093-1096 (in Russian);
22. English transl: Soviet Math. Dokl. 20 (1979), 191-194.
23. P. KOIRAN (1994). Computing over the reals with addition and order. Theoret. Comput. Sci. 133, 35-47.
24. M. W. KRENTEL (1986). The complexity of optimization problems. In Proc. 18th Annual ACM Symposium on the Theory of Computing (Berkeley, CA), 79-86.
25. W. S. MASSEY (1977). Algebraic Topology: an Introduction. Grad. Texts in Math. 56, Springer, New York. Reprint of the 1967 edition.
26. F. MEYER AUF DER HEIDE (1984). A polynomial linear search algorithm for the n-dimensional knapsack problem. J. ACM 31, 668-676.
27. J. R. MUNKRES (1984). Elements of Algebraic Topology. Addison-Wesley, Menlo Park, CA.
28. G. H. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
29. C. H. PAPADIMITRIOU & S. ZACHOS (1983). Two remarks on the power of counting. In Proc. 6th GI conference in Theoretical Computer Science, Lecture Notes in Cornput. Sci. 145, Springer, 269-276.
30. M. RABIN (1958). Recursive unsolvability of group theoretic problems. Ann. of Math. 67, 172-194.
31. M. SCHECHTER (1998). Integration over a polyhedron: an application of the Fourier-Motzkin elimination method. Amer. Math. Monthly 105, 246-251.
32. I. R. SHAFAREVICH (1974). Basic Algebraic Geometry. Springer.
33. S. SMALE (1983). On the average number of steps of the simplex method of linear programming. Math. Program. 27, 241-262.
34. S. SMALE (1998). Mathematical problems for the next century. Math. Intelligencer 20, 7-15.
35. R. STÖCKER & H. ZIESCHANG (1988). Algebraische Topologie. Math. Leitfäden, B. G. Teubner, Stuttgart.
36. E. TARDOS (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250-256.
37. S. TODA (1991). PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 21, 865-877.
38. S. TODA & O. WATANABE (1992). Polynomial time 1-Turing reductions from #PH to #P. Theoret. Comput. Sci. 100, 205-221.
39. L. G. VALIANT (1979a). The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201.
40. L. G. VALIANT (1979b). The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410-421.