Descriptive Complexity
Neil Immerman
dek, 2012 · Springer Science & Business Media
E-kitob
268
Sahifalar soni
reportReytinglar va sharhlar tasdiqlanmagan Batafsil
Bu e-kitob haqida
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.
Bu e-kitobni baholang
Fikringizni bildiring.
Qayerda o‘qiladi
Smartfonlar va planshetlar
Android va iPad/iPhone uchun mo‘ljallangan Google Play Kitoblar ilovasini o‘rnating. U hisobingiz bilan avtomatik tazrda sinxronlanadi va hatto oflayn rejimda ham kitob o‘qish imkonini beradi.
Noutbuklar va kompyuterlar
Google Play orqali sotib olingan audiokitoblarni brauzer yordamida tinglash mumkin.
Kitob o‘qish uchun mo‘ljallangan qurilmalar
Kitoblarni Kobo e-riderlar kabi e-siyoh qurilmalarida oʻqish uchun faylni yuklab olish va qurilmaga koʻchirish kerak. Fayllarni e-riderlarga koʻchirish haqida batafsil axborotni Yordam markazidan olishingiz mumkin.
