Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
lower bounds
randomized decision tree complexity |
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:namedAfter |
gptkb:Michael_Sipser
gptkb:Ravi_Boppana |
| gptkbp:publicationYear |
1990
|
| gptkbp:publishedIn |
gptkb:Combinatorica
|
| gptkbp:result |
establishes lower bounds for randomized decision tree complexity of certain Boolean functions
|
| gptkbp:bfsParent |
gptkb:Ravi_Boppana
|
| gptkbp:bfsLayer |
7
|
| http://www.w3.org/2000/01/rdf-schema#label |
Boppana–Sipser theorem
|