Lower bounds on testing membership to a polyhedron by algebraic decision trees

Authors:
Dima Grigoriev;Marek Karpinski;Nicolai Vorobjov
Affiliations:
Departments of Computer Science and Mathematics, Penn State University, University Park, PA;Department of Computer Science, University of Bonn, 53117 Bonn, and the International Computer Science Institute, Berkeley, Colifornia;Departments of Computer Science and Mathematics, Penn State University, University Park, PA
Venue:
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Year:
1994

Citing 11
Cited 0

Fast algorithms for n-dimensional restrictions of hard problems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Complexity of deciding Tarski algebra

Journal of Symbolic Computation
Linear decision trees: volume estimates and topological bounds

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
On randomized semi-algebraic test complexity

Journal of Complexity
Counting connected components of a semialgebraic set in subexponential time

Computational Complexity
Decision tree complexity and Betti numbers

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

FCT '85 Fundamentals of Computation Theory
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees

Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees

Quantified Score

Hi-index	0.00

Visualization

Abstract