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