Lower bounds on probabilistic linear decision trees
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 38, 69-82
- https://doi.org/10.1016/0304-3975(85)90210-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972