Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496)
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: Lower bounds for one-way probabilistic communication complexity and their application to space complexity |
scientific article; zbMATH DE number 984410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for one-way probabilistic communication complexity and their application to space complexity |
scientific article; zbMATH DE number 984410 |
Statements
Lower bounds for one-way probabilistic communication complexity and their application to space complexity (English)
0 references
27 February 1997
0 references
boolean functions
0 references
deterministic communication complexity
0 references
probabilistic communication characteristic
0 references
0 references
0.9647747
0 references
0.89350307
0 references
0.89317477
0 references
0.8928822
0 references
0.8905306
0 references
0.88881767
0 references
0.88581836
0 references
