Descriptive Complexity - Neil Immerman
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to datab ... Full description
You May Also Like
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-20% with code BOOKS
In stock at our supplier
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
A Short History of Nearly Everything 2.0
-20% with code BOOKS
In stock at our supplier
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-20% with code BOOKS
In stock at our supplier
TOP
A Brief History of Time: From the Big Bang to Black Holes
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-20% with code BOOKS
In stock at our supplier
TOP
Universe: The Definitive Visual Guide
-20% with code BOOKS
In stock at our supplier
Description
A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
More Information
| Author | Neil Immerman |
|---|---|
| Publisher | Springer New York |
| Series | Texts in Computer Science |
| Release year | 2012 |
| Cover type | Softcover |
| EAN | 9781461268093 |