Arbeitspapier
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
This paper establishes an elementary lower bound on the computational complexity of smooth functions between Euclidean spaces(actually, smooth manifolds). The main motivation for this comes from mechanism design theory. The complexity of computations required by a mechanism determines an element of the costs associated with that mechanism. The lower bound presented in this paper is useful in part because it does not require specification in detail of the computations to be performed by the mechanism, but depends only on the goal function that the mechanism is to realize or implement.
- Language
-
Englisch
- Bibliographic citation
-
Series: Discussion Paper ; No. 1085
- Classification
-
Wirtschaft
- Event
-
Geistige Schöpfung
- (who)
-
Mount, Kenneth R.
Reiter, Stanley
- Event
-
Veröffentlichung
- (who)
-
Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
- (where)
-
Evanston, IL
- (when)
-
1994
- Handle
- Last update
-
10.03.2025, 11:43 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Mount, Kenneth R.
- Reiter, Stanley
- Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
Time of origin
- 1994
Other Objects (12)
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Number theoretic methods in cryptography : complexity lower bounds
Lower bounds on the state complexity of population protocols
Hadamard tensors and lower bounds on multiparty communication complexity
Essential Revelation Mechanisms and Computational Complexity
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Holographic complexity bounds
Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Number theoretic methods in cryptography : complexity lower bounds
Lower bounds on the state complexity of population protocols
Hadamard tensors and lower bounds on multiparty communication complexity
Essential Revelation Mechanisms and Computational Complexity
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Holographic complexity bounds
Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Number theoretic methods in cryptography : complexity lower bounds
Lower bounds on the state complexity of population protocols
Hadamard tensors and lower bounds on multiparty communication complexity
Essential Revelation Mechanisms and Computational Complexity
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Holographic complexity bounds
Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness