On P versus \(\text{NP}\cap co-\text{NP}\) for decision trees and read-once branching programs (Q4699308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1361490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On P versus \(\text{NP}\cap co-\text{NP}\) for decision trees and read-once branching programs |
scientific article; zbMATH DE number 1361490 |
Statements
10 November 1999
0 references
Boolean function
0 references
0.9964870810508728
0 references
0.8281883001327515
0 references
0.7877861857414246
0 references
On P versus \(\text{NP}\cap co-\text{NP}\) for decision trees and read-once branching programs (English)
0 references
