Publication: Computational Complexity
Loading...
Open/View Files
Date
2011
Authors
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Vadhan, Salil P. 2011. Computational complexity. In Encyclopedia of Cryptography and Security, second edition, ed. Henk C.A. van Tilborg and Sushil Jajodia. New York: Springer.
Abstract
Description
Other Available Sources
Research Data
Keywords
exponential time, O-notation, one-way function, polynomial time, security (computational, unconditional), sub-exponential time
Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service