First Page | Document Content | |
---|---|---|
Date: 2011-12-13 09:31:41Computational complexity theory Complexity classes Analysis of algorithms Mathematical optimization Structural complexity theory P versus NP problem NP Average-case complexity Computational complexity Reduction Randomized algorithm BPP | A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CAAdd to Reading ListSource URL: www.karlin.mff.cuni.czDownload Document from Source WebsiteFile Size: 193,57 KBShare Document on Facebook |
The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of OxfordDocID: 1r1Rx - View Document | |
ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWzDocID: 1qYTn - View Document | |
Microsoft Word - MS-wccm12DocID: 1qPof - View Document | |
Microsoft Word - fp16-armoni.docDocID: 1qoBn - View Document | |
Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas SummaryDocID: 1qeXR - View Document |