Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Descriptive Complexity - Neil Immerman

Anglų
2012-09-30
105,17 € 140,23 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo politika

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 ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Autorius Neil Immerman
Leidėjas Springer New York
Series Texts in Computer Science
Išleidimo metai 2012
Viršelio tipas Minkšti viršeliai
EAN 9781461268093
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Descriptive Complexity
Jūsų įvertinimas:

Goodreads Atsiliepimai

105,17 € 140,23 €