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

	Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published DocID: 1xTZi - View Document
	Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published DocID: 1xTH1 - View Document
	PP_icon-1_Einladung_A4_L3.indd DocID: 1xTEi - View Document
	ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp DocID: 1xTyC - View Document
	Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published DocID: 1xTht - View Document