First Page | Document Content | |
---|---|---|
Date: 2010-03-11 22:26:05Probabilistic complexity theory Sipser–Lautemann theorem Structural complexity theory IP Bounded-error probabilistic polynomial FO Polynomials Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Computational complexity theory Applied mathematics | Add to Reading ListSource URL: www.ccs.neu.eduDownload Document from Source WebsiteFile Size: 202,83 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 |