Descriptive Complexity
Immerman, Neil
ISBN 10: 0387986006 ISBN 13: 9780387986005
Published by Springer, 1998
New
Hardcover
From
GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since April 6, 2009
This specific item is no longer available.
About this Item
Description:
Seller Inventory # 672679-n
Synopsis:
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.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Descriptive Complexity
Publisher: Springer
Publication Date: 1998
Binding: Hardcover
Condition: New
Top Search Results from the AbeBooks Marketplace
Stock Image
Descriptive Complexity (Texts in Computer Science)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580175412
Quantity: Over 20 available
Stock Image
Descriptive Complexity (Hardcover)
Published by
Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10: 0387986006
ISBN 13: 9780387986005
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780387986005
Quantity: 1 available
Stock Image
Descriptive Complexity (Texts in Computer Science)
Seller: BennettBooksLtd, San Diego, NV, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0387986006
Quantity: 1 available
Stock Image
Descriptive Complexity (Texts in Computer Science)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780387986005
Quantity: Over 20 available
Stock Image
Descriptive Complexity (Texts in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780387986005_new
Quantity: Over 20 available
Seller Image
Descriptive Complexity
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Self-contained introduction to a fundamental area in computer science Provides readers with an understanding of logic and complexity Explores applications and future directions Includes numerous examples and exercises to further illustrate the ideas present. Seller Inventory # 5913397
Quantity: Over 20 available
Seller Image
Descriptive Complexity
Published by
Springer New York Nov 1998, 1998
ISBN 10: 0387986006
ISBN 13: 9780387986005
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware - 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. Seller Inventory # 9780387986005
Quantity: 2 available
Stock Image
Descriptive Complexity (Hardcover)
Published by
Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10: 0387986006
ISBN 13: 9780387986005
New
Hardcover
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780387986005
Quantity: 1 available