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.
"Sinopsis" puede pertenecer a otra edición de este libro.
By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 2,26 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoEUR 3,41 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030028290
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 19849973-n
Cantidad disponible: 15 disponibles
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
Paperback. Condición: new. Paperback. 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. Nº de ref. del artículo: 9781461268093
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9781461268093
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781461268093_new
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9781461268093
Cantidad disponible: 10 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 19849973
Cantidad disponible: 15 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises. 288 pp. Englisch. Nº de ref. del artículo: 9781461268093
Cantidad disponible: 2 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 439. Nº de ref. del artículo: C9781461268093
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Nº de ref. del artículo: 4189450
Cantidad disponible: Más de 20 disponibles