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 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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Professor 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 25,80 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoEUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoLibrería: More Than Words, Waltham, MA, Estados Unidos de America
Condición: Good. . . All orders guaranteed and ship within 24 hours. Before placing your order for please contact us for confirmation on the book's binding. Check out our other listings to add to your order for discounted shipping. Nº de ref. del artículo: WAL-U-0b-01864
Cantidad disponible: 1 disponibles
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Nº de ref. del artículo: Z1-E-005-01895
Cantidad disponible: 2 disponibles
Librería: Orca Knowledge Systems, Inc., Novato, CA, Estados Unidos de America
Hardcover. Condición: Fine. Estado de la sobrecubierta: DJ not issued. DJ not issued. Unread, unmarked book. DJ rubbings. Nº de ref. del artículo: mon0000012807
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students). Mathematical Reviews. Nº de ref. del artículo: 4453258
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 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. 180 pp. Englisch. Nº de ref. del artículo: 9783110168105
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 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. Nº de ref. del artículo: 9783110168105
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783110168105_new
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
HRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L1-9783110168105
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
HRD. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L1-9783110168105
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Buch. Condición: Neu. Neuware -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 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.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 180 pp. Englisch. Nº de ref. del artículo: 9783110168105
Cantidad disponible: 2 disponibles