{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":18,"n_cols":5,"rows_kept":18,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910785819303321"]
[null,null,"Titolo",null,"Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; New York, : Walter de Gruyter, 2001"]
[null,null,"ISBN",null,"3-11-088917-X"]
[null,null,"Edizione",null,"[Reprint 2010]"]
[null,null,"Descrizione fisica",null,"1 online resource (180 p.)"]
[null,null,"Collana",null,"De Gruyter series in logic and its applications ; ; 4"]
[null,null,"Classificazione",null,"SD 2000"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computational complexity"]
[{"$nulls":4},"Machine theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Front matter -- Basic complexity / Allender, Eric / McCartin, Catherine -- Three lectures on real computation / Cucker, Felipe -- Parameterized complexity: new developments and research frontiers / Fellows, Michael R. -- Kolmogorov complexity / Fortnow, Lance -- Complexity and computation in matrix groups / Niemeyer, Alice C. / Praeger, Cheryl E. -- The complexity of counting problems / Welsh, Dominic / Gale, Amy -- The Ω conjecture / Woodin, W. Hugh -- List of contributors"]
[null,null,null,"Sommario/riassunto","The 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"]