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

First Page		Document Content
Date: 2001-10-25 12:45:35 Computational 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 FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 281,67 KB Share Document on Facebook

	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 DocID: 1qYTn - View Document
	Microsoft Word - MS-wccm12 DocID: 1qPof - View Document
	Microsoft Word - fp16-armoni.doc DocID: 1qoBn - View Document
	Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary DocID: 1qeXR - View Document