CHF 183.60

Descriptive Complexity

English · Hardback

Shipping usually within 3 to 5 weeks

This item cannot be returned.

Description

Read more

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.

Product details

Authors Neil Immerman
Publisher Springer, Berlin
 
Content Book
Product form Hardback
Publication date 26.03.2002
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT
 
EAN 9780387986005
ISBN 978-0-387-98600-5
Pages 268
Illustrations XVI, 268 p.
Dimensions (packing) 17.1 x 24.3 x 2.2 cm
Weight (packing) 608 g
 
Series Texts in Computer Science
Graduate Texts in Computer Science
Texts in Computer Science
Subjects COMPUTERS / Computer Science, Netzwerk-Hardware, Theoretische Informatik, COMPUTERS / Logic Design, COMPUTERS / Networking / General, Computers - Languages / Programming
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.