A comparison of two lower-bound methods for communication complexity (Q1350995)
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 984227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of two lower-bound methods for communication complexity |
scientific article; zbMATH DE number 984227 |
Statements
A comparison of two lower-bound methods for communication complexity (English)
0 references
27 February 1997
0 references
0.9918462634086608
0 references
0.8240857720375061
0 references
0.8240857720375061
0 references
0.8190140724182129
0 references
