On the P versus NP intersected with co-NP question in communication complexity (Q1044738)
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 5650156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the P versus NP intersected with co-NP question in communication complexity |
scientific article; zbMATH DE number 5650156 |
Statements
On the P versus NP intersected with co-NP question in communication complexity (English)
0 references
18 December 2009
0 references
computational complexity
0 references
communication complexity
0 references
0 references
0.89208645
0 references
0.87278885
0 references
0.8661523
0 references
0.8631706
0 references
0.8631706
0 references
0.86124825
0 references
0.8582001
0 references
0.8555268
0 references
