CURRENTLY SOLD OUT
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $39.90Trending at AU $51.50
- AU $72.89Trending at AU $75.73
- AU $32.80Trending at AU $40.84
- AU $30.99Trending at AU $39.99
- AU $19.55Trending at AU $23.96
- AU $32.00Trending at AU $45.25
- AU $14.60Trending at AU $16.66
About this product
- DescriptionThe 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 canical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.
- Author BiographyProfessor Rod Downey, School of Mathematics and Computer Sciences, Victoria University, Wellington, New Zealand. Professor Denis Hirschfeldt, School of Mathematics and Computer Sciences, Victoria University, Wellington, New Zealand.
- PublisherDe Gruyter
- Date of Publication19/10/2001
- Series TitleDe Gruyter Series in Logic & its Applications
- Series Part/Volume Numberv. 4
- Place of PublicationBerlin
- Country of PublicationGermany
- ImprintWalter de Gruyter & Co
- Content NoteNum. figs. and tabl.
- Weight461 g
- Width155 mm
- Height230 mm
- Spine11 mm
- Edited byDenis Hirschfeld,Denis Hirschfeldt,Rod Downey
- Interest AgeCollege Graduate Student
This item doesn't belong on this page.
Thanks, we'll look into this.