On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On P versus NPco-NP for decision trees and read-once branching programs |
scientific article; zbMATH DE number 1533080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs |
scientific article; zbMATH DE number 1533080 |
Statements
On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (English)
0 references
20 November 2000
0 references
computational complexity
0 references
decision trees
0 references
branching programs
0 references
Boolean function
0 references
0 references
0.8833173
0 references
0.8833173
0 references
0.8792409
0 references
0.87609917
0 references
0.87573564
0 references
