LEADER 02760oam 2200457zu 450 001 9910145611703321 005 20241212215430.0 010 $a9781509098248 010 $a1509098240 035 $a(CKB)1000000000278123 035 $a(SSID)ssj0000451847 035 $a(PQKBManifestationID)12140692 035 $a(PQKBTitleCode)TC0000451847 035 $a(PQKBWorkID)10463759 035 $a(PQKB)11105778 035 $a(NjHacI)991000000000278123 035 $a(EXLCZ)991000000000278123 100 $a20160829d2006 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$a21st Annual IEEE Conference on Computational Complexity (CCC 2006): 16-20 July 2006/Prague, Czech Republic 210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2006 215 $a1 online resource 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780769525969 311 08$a0769525962 327 $aProceedings. Twenty-First Annual IEEE Conference on Computational Complexity -- 21st Annual IEEE Conference on Computational Complexity - Title -- 21st Annual IEEE Conference on Computational Complexity - Copyright -- 21st Annual IEEE Conference on Computational Complexity - TOC -- Preface -- Committees -- Reviewers -- Awards -- Godel and Computations -- Polynomial identity testing for depth 3 circuits -- Every Linear Threshold Function has a Low-Weight Approximator -- Constructions of low-degree and error-correcting /spl epsi/-biased generators -- How to Get More Mileage from Randomness Extractors -- Exposure-resilient extractors -- Making hard problems harder. 330 $aThis annual conference covers all areas of computational complexity theory and encompasses results from other areas of computer science and mathematics motivated by topics in complexity theory. The 30 papers in CCC 2006 focuses on computational complexity while addressing topics such as complexity classes, algebraic complexity, proof complexity, interactive proof systems, circuits and other concrete computational models. It also examines subjects in Kolmogorov complexity, average case complexity reducibility, communication complexity, complexity and logic, nonapproximability, cryptographic complexity, complexity and learning, quantum computation, and derandomization. 606 $aComputational complexity$vCongresses 606 $aLogic programming$vCongresses 615 0$aComputational complexity 615 0$aLogic programming 676 $a511.3 801 0$bPQKB 906 $aPROCEEDING 912 $a9910145611703321 996 $a21st Annual IEEE Conference on Computational Complexity (CCC 2006): 16-20 July 2006$92371755 997 $aUNINA