Advertisement

The Complexity of Semilinear Problems in Succinct Representation

  • Peter Bürgisser
  • Felipe Cucker
  • Paulin Jacobé de Naurois
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3623)

Abstract

We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real constants are allowed in the circuit, the completeness results are for the Blum-Shub-Smale additive model of computation. If, in contrast, the circuit is constant-free, then the completeness results are for the Turing model of computation. One such result, the P NP[ log] -completeness of deciding Zariski irreducibility, exhibits for the first time a problem with a geometric nature complete in this class.

Keywords

Polynomial Time Irreducible Component Feasibility Problem Zariski Closure Input Gate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adian, S.I.: Unsolvability of certain algorithmic problems in the theory of groups. Trudy Moskov. Math. Obshch. 6, 231–298 (1957) (in Russian)Google Scholar
  2. 2.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)Google Scholar
  3. 3.
    Bürgisser, P., Cucker, F.: Counting complexity classes for numeric computations I: Semilinear sets. SIAM J. Comp. 33, 227–260 (2004)CrossRefGoogle Scholar
  4. 4.
    Chandra, A., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. Comp. 13, 423–439 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cucker, F., Koiran, P.: Computing over the reals with addition and order: Higher complexity classes. Journal of Complexity 11, 358–376 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fournier, H., Koiran, P.: Are lower bounds easier over the reals? In: Proc. 30th ACM STOC, pp. 507–513 (1998)Google Scholar
  7. 7.
    Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact Analysis of Dodgson Elections: Lewis Carroll’s 1876 Voting System is Complete for Parallel Access to NP. Journal of the ACM, 806–825 (1997)Google Scholar
  8. 8.
    Khachijan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093–1096 (1979); in Russian, English translation in Soviet Math. Dokl., 20, 191–194 (1979)Google Scholar
  9. 9.
    Koiran, P.: Computing over the reals with addition and order. Theoretical Computer Science 133, 35–47 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Krentel, M.W.: The complexity of optimization problems. In: Proc. 18th ACM Symp. on the Theory of Computing, pp. 79–86 (1986)Google Scholar
  11. 11.
    Meyer auf der Heide, F.: A polynomial linear search algorithm for the n-dimensional knapsack problem. J. ACM 31, 668–676 (1984)zbMATHCrossRefGoogle Scholar
  12. 12.
    Papadimitriou, C.H.: On the complexity of unique solutions. J. ACM 31, 392–400 (1984)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)zbMATHGoogle Scholar
  14. 14.
    Papadimitriou, C.H., Zachos, S.: Two remarks on the power of counting. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 269–276. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  15. 15.
    Rabin, M.: Recursive unsolvability of group theoretic problems. Ann. of Math. 67(2), 172–194 (1958)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Shafarevich, I.R.: Basic Algebraic Geometry. Springer, Heidelberg (1974)zbMATHGoogle Scholar
  17. 17.
    Smale, S.: Mathematical problems for the next century. Mathematical Intelligencer 20, 7–15 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250–256 (1986)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Peter Bürgisser
    • 1
  • Felipe Cucker
    • 2
  • Paulin Jacobé de Naurois
    • 3
  1. 1.Dept. of MathematicsUniversity of PaderbornPaderbornGermany
  2. 2.Department of MathematicsCity University of Hong KongHong KongP.R. of China
  3. 3.LORIAVillers-lès-Nancy Cedex, NancyFrance

Personalised recommendations