First Page | Document Content | |
---|---|---|
Date: 2001-10-25 12:45:35Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P | ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWzAdd to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source WebsiteFile Size: 281,67 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 |