A lower bound on computational complexity given by revelation mechanisms (Q1920945)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on computational complexity given by revelation mechanisms |
scientific article |
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
