Proof Complexity Generators - Krají&
-30% ar kodu BOOKS
Piegāde 22-28 darba dienu laikā
30 dienu atgriešanas politika
The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of pro ... Pilns apraksts
Jums varētu patikt arī
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Behave: The Biology of Humans at Our Best and Worst
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Secrets of our DNA: How Genetics has Changed the World
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-30% ar kodu BOOKS
Noliktavā
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Determined: The Science of Life Without Free Will
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Thing Explainer: Complicated Stuff in Simple Words
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Universe: The Definitive Visual Guide
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Entangled Life: How Fungi Make Our Worlds, Change Our Minds and Shape Our Futures
-30% ar kodu BOOKS
Nav noliktavā
TOP
How Far the Light Reaches: A Life in Ten Sea Creatures
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research.
Vairāk informācijas
| Autors | Krají& |
|---|---|
| Izdevējs | Cambridge University Press |
| Izlaides gads | 2025 |
| Vāka tips | Mīkstais vāks |
| EAN | 9781009611701 |