A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
The complexity of optimization problems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Computing over the reals with addition and order
Selected papers of the workshop on Continuous algorithms and complexity
Computing over the reals with addition and order: higher complexity classes
Journal of Complexity
Complexity and real computation
Complexity and real computation
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of unique solutions
Journal of the ACM (JACM)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
SIAM Journal on Computing
Hi-index | 0.00 |
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 PNP[log]-completeness of deciding Zariski irreducibility, exhibits for the first time a problem with a geometric nature complete in this class.