LEADER 01626oam  2200397zu 450 
001 9910872930103321
005 20241212215204.0
035   $a(CKB)111085500343012
035   $a(SSID)ssj0000455434
035   $a(PQKBManifestationID)12168712
035   $a(PQKBTitleCode)TC0000455434
035   $a(PQKBWorkID)10405029
035   $a(PQKB)11023384
035   $a(NjHacI)99111085500343012
035   $a(EXLCZ)99111085500343012
100   $a20160829d2003      uy 
101 0 $aeng
135   $aur|||||||||||
181   $ctxt
182   $cc
183   $acr
200 10$a18th IEEE Annual Conference on Computational Complexity
210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2003
215   $a1 online resource (402 pages)
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a9780769518794 
311 08$a0769518796 
330   $aThis is an annual conference that deals with computational complexity in very broad terms. Complexity 2003 looks into topics such as complexity classes, algebraic complexity, proof complexity, interactive proof systems, Kolmogorov complexity, Reducibility, communication complexity, complexity and logic, nonapproximability, cryptographic complexity, complexity and learning, quantum computation, circuits and other concrete computational models.
606   $aComputational complexity
615  0$aComputational complexity.
676   $a511.3
801  0$bPQKB
906   $aPROCEEDING
912   $a9910872930103321
996   $a18th IEEE Annual Conference on Computational Complexity$92384717
997   $aUNINA