Search Problems and Bounded Arithmetic: Between Computational Complexity and Logic - Ji¿í Hanika
-30% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas politika
In the intersection of mathematical logic and computer science, this book investigates the search problems and reducibilities among them that have known or potential relevance to bounded arithmetic theories. The same structures are viewed from two very different angles: that of computational complexity, and that of sets of low complexity consequences of weak logical theories, bounded arithmetics. Two distin ... Pilns apraksts
Jums varētu patikt arī
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
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-30% ar kodu BOOKS
Piegādātāja noliktavā
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
Determined: The Science of Life Without Free Will
-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
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How to Solve it: A New Aspect of Mathematical Method
-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
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ā
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
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
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Feynman Lectures on Physics. The New Millennium Edition
Matthew Sands, Robert Leighton, Richard Feynman
-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
Behave: The Biology of Humans at Our Best and Worst
-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ā
Aprašymas
In the intersection of mathematical logic and computer science, this book investigates the search problems and reducibilities among them that have known or potential relevance to bounded arithmetic theories. The same structures are viewed from two very different angles: that of computational complexity, and that of sets of low complexity consequences of weak logical theories, bounded arithmetics. Two distinct techniques of characterization of such sets by search problems are presented, with Herbrand's theorem at the root of both. Additional attention is paid to search problems from the minimization family, although their logical counterparts are mostly still to be discovered. In this way, the two worlds throw light onto each other.
Vairāk informācijas
| Autors | Ji¿í Hanika |
|---|---|
| Izdevējs | LAP LAMBERT Academic Publishing |
| Izlaides gads | 2011 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783845408347 |