On the complexity of computations under varying sets of primitives

Authors:
David P. Dobkin;Richard J. Lipton
Affiliations:
-;-
Venue:
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Year:
1975

Citing 0
Cited 3

Linear decision trees: volume estimates and topological bounds

STOC '92 Proceedings of the twenty-fourth 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
A nonlinear lower bound on linear search tree programs for solving knapsack problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract