A lower bound on computational complexity given by revelation mechanisms (Q1920945)
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: Publication:1920945 |
scientific article; zbMATH DE number 913877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on computational complexity given by revelation mechanisms |
scientific article; zbMATH DE number 913877 |
Statements
A lower bound on computational complexity given by revelation mechanisms (English)
0 references
20 October 1996
0 references
computational complexity
0 references
0 references
0.7353872060775757
0 references
0.7179678678512573
0 references
0.717967689037323
0 references
0.7168499827384949
0 references
0.7099401950836182
0 references
