Linear decision trees: volume estimates and topological bounds

Authors:
Anders Björner;László Lovász;Andrew C. C. Yao
Affiliations:
Royal Institute of Technology, Stockholm, Sweden S-100 44;Eötvös Loránd University, Budapest, Hungary H-1088, Princeton University, Princeton, NJ;Princeton University, Princeton, NJ
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 5
Cited 17

Enumerative combinatorics

Enumerative combinatorics
Topological methods

Handbook of combinatorics (vol. 2)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
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

Decision trees: old and new results

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computational geometry: a retrospective

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Decision tree complexity and Betti numbers

STOC '94 Proceedings of the twenty-sixth 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
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
Characteristic and Ehrhart Polynomials

Journal of Algebraic Combinatorics: An International Journal
Whitney Homology of Semipure Shellable Posets

Journal of Algebraic Combinatorics: An International Journal
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
Lower bounds for linear degeneracy testing

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The $k$-Equal Problem

Combinatorics, Probability and Computing
Lower bounds for linear degeneracy testing

Journal of the ACM (JACM)
Homology representations arising from the half cube, II

Journal of Combinatorial Theory Series A
Lower bounds for linear decision trees via an energy complexity argument

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science

Quantified Score

Hi-index	0.00

Linear decision trees: volume estimates and topological bounds

Quantified Score

Visualization

Abstract