<--- Back to Details
First PageDocument Content
Computational 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
Date: 2011-12-13 09:31:41
Computational 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, CA

Add to Reading List

Source URL: www.karlin.mff.cuni.cz

Download Document from Source Website

File Size: 193,57 KB

Share Document on Facebook

Similar Documents

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

DocID: 1r1Rx - View Document

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND  LANCE FORTNOWz

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

DocID: 1qYTn - View Document

Microsoft Word - MS-wccm12

Microsoft Word - MS-wccm12

DocID: 1qPof - View Document

Microsoft Word - fp16-armoni.doc

Microsoft Word - fp16-armoni.doc

DocID: 1qoBn - View Document

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas  Summary

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

DocID: 1qeXR - View Document