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 |