Proof Complexity Generators - Krají&
-25% koodilla BOOKS
Toimitus 22-28 arkipäivässä
30 päivän palautusoikeus
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 ... Täydellinen kuvaus
Saatat myös pitää
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Behave: The Biology of Humans at Our Best and Worst
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Determined: The Science of Life Without Free Will
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Secrets of our DNA: How Genetics has Changed the World
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-25% koodilla BOOKS
Varastossa
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
A Short History of Nearly Everything 2.0
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
A Brief History of Time: From the Big Bang to Black Holes
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Thing Explainer: Complicated Stuff in Simple Words
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Krají& |
|---|---|
| Julkaisija | Cambridge University Press |
| Julkaisuvuosi | 2025 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9781009611701 |