DocumentCode
3453140
Title
Decision trees and downward closures
Author
Impagliazzo, Russell ; Naor, Moni
Author_Institution
California Univ., Berkeley, CA, USA
fYear
1988
fDate
14-17 Jun 1988
Firstpage
29
Lastpage
38
Abstract
The separation of small complexity classes is considered. Some downward closure results are derived which show that some intuitively arrive at results that were published previously are misleading. This is done by giving uniform versions of simulations in the decision-tree model of concrete complexity. The results also show that sublinear-time computation has enough power to code interesting questions in polynomial-time complexity
Keywords
computational complexity; decision theory; trees (mathematics); decision trees; downward closures; polynomial-time complexity; simulations; small complexity classes; sublinear-time computation; Bismuth; Complexity theory; Computational modeling; Concrete; Decision trees; Page description languages; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual
Conference_Location
Washington, DC
Print_ISBN
0-8186-0866-8
Type
conf
DOI
10.1109/SCT.1988.5260
Filename
5260
Link To Document