Randomness and Completeness in Computational Complexity - Dieter van Melkebeek
-30% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di ... Pilns apraksts
Jums varētu patikt arī
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
HBR Guide to Generative AI for Managers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.
Vairāk informācijas
| Autors | Dieter van Melkebeek |
|---|---|
| Izdevējs | Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Izlaides gads | 2000 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783540414926 |