Lower bounds for algebraic decision trees
- 1 March 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (1) , 1-8
- https://doi.org/10.1016/0196-6774(82)90002-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- On the Division of the Plane by LinesThe American Mathematical Monthly, 1978
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978
- A nonlinear lower bound on linear search tree programs for solving knapsack problemsJournal of Computer and System Sciences, 1976
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Einige Gesetze über die Theilung der Ebene und des Raumes.Journal für die reine und angewandte Mathematik (Crelles Journal), 1826