Enumerative combinatorics
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the complexity of computations under varying sets of primitives
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds on testing membership to a polyhedron by algebraic decision trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing the complexification of a semi-algebraic set
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A lower bound for randomized algebraic decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized complexity lower bounds
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Computational topology: ambient isotopic approximation of 2-manifolds
Theoretical Computer Science - Topology in computer science
Time complexity of decision trees
Transactions on Rough Sets III
Hi-index | 0.00 |