The Complexity of Semilinear Problems in Succinct Representation
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.
KeywordsPolynomial Time Irreducible Component Feasibility Problem Zariski Closure Input Gate
Unable to display preview. Download preview PDF.
- 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.Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)Google Scholar
- 6.Fournier, H., Koiran, P.: Are lower bounds easier over the reals? In: Proc. 30th ACM STOC, pp. 507–513 (1998)Google Scholar
- 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.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
- 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