LEADER 03201nam  2200661Ia 450 
001 9910461999603321
005 20211202025418.0
010   $a3-11-088917-X
024 7 $a10.1515/9783110889178
035   $a(CKB)2670000000251019
035   $a(EBL)937935
035   $a(SSID)ssj0000594710
035   $a(PQKBManifestationID)11372656
035   $a(PQKBTitleCode)TC0000594710
035   $a(PQKBWorkID)10549700
035   $a(PQKB)11055189
035   $a(MiAaPQ)EBC937935
035   $a(WaSeSS)Ind00009167
035   $a(DE-B1597)55929
035   $a(OCoLC)979883477
035   $a(DE-B1597)9783110889178
035   $a(Au-PeEL)EBL937935
035   $a(CaPaEBR)ebr10597936
035   $a(OCoLC)843635662
035   $a(EXLCZ)992670000000251019
100   $a20010726d2001      uy             0
101 0 $aeng
135   $aurnn#---|u||u
181   $ctxt
182   $cc
183   $acr
200 00$aAspects of complexity$b[electronic resource] $eminicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /$feditors Rod Downey, Denis Hirschfeldt
205   $aReprint 2010
210   $aBerlin ;$aNew York $cWalter de Gruyter$d2001
215   $a1 online resource (180 p.)
225 0 $aDe Gruyter series in logic and its applications ;$v4
300   $aDescription based upon print version of record.
311 0 $a3-11-016810-3 
320   $aIncludes bibliographical references.
327   $tFront matter --$tBasic complexity /$rAllender, Eric / McCartin, Catherine --$tThree lectures on real computation /$rCucker, Felipe --$tParameterized complexity: new developments and research frontiers /$rFellows, Michael R. --$tKolmogorov complexity /$rFortnow, Lance --$tComplexity and computation in matrix groups /$rNiemeyer, Alice C. / Praeger, Cheryl E. --$tThe complexity of counting problems /$rWelsh, Dominic / Gale, Amy --$tThe ? conjecture /$rWoodin, W. Hugh --$tList of contributors
330   $aThe book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i
410  3$aDe Gruyter Series in Logic and Its Applications
606   $aComputational complexity$vCongresses
606   $aMachine theory$vCongresses
608   $aElectronic books.
615  0$aComputational complexity
615  0$aMachine theory
676   $a511.3
686   $aSD 2000$2rvk
701   $aDowney$b R. G$g(Rod G.)$0930867
701   $aHirschfeldt$b Denis Roman$0916929
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910461999603321
996   $aAspects of complexity$92492112
997   $aUNINA