1.

Record Nr.

UNINA9910785819303321

Titolo

Aspects of complexity [[electronic resource] ] : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / / editors Rod Downey, Denis Hirschfeldt

Pubbl/distr/stampa

Berlin ; ; New York, : Walter de Gruyter, 2001

ISBN

3-11-088917-X

Edizione

[Reprint 2010]

Descrizione fisica

1 online resource (180 p.)

Collana

De Gruyter series in logic and its applications ; ; 4

Classificazione

SD 2000

Altri autori (Persone)

DowneyR. G (Rod G.)

HirschfeldtDenis Roman

Disciplina

511.3

Soggetti

Computational complexity

Machine theory

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references.

Nota di contenuto

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

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