Descriptive Complexity (Texts in Computer Science) Book + PRICE WATCH * Amazon pricing is not included in price watch

Descriptive Complexity (Texts in Computer Science) Book

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 databases, it turns out that this subject has important applications to databases such as analyzing the queries computable in polynomial time, analyzing the parallel time needed to compute a query, and the analysis of non-deterministic 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. Read More

from£90.06 | RRP: £81.00
* Excludes Voucher Code Discount Also available Used from £71.50
  • 0387986006
  • 9780387986005
  • Neil Immerman
  • 1 January 1999
  • Springer
  • Hardcover (Book)
  • 268
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.