Proving lower bounds for linear decision trees
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 305-315
- https://doi.org/10.1007/3-540-10843-2_25
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- On lifted problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- Using computer trees to derive lower bounds for selection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Realizing Boolean functions on disjoint sets of variablesTheoretical Computer Science, 1976
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- On the complexity of comparison problems using linear functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Computing the maximum and the medianPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971