Descriptive Complexity
Neil Immerman
дец 2012. · Springer Science & Business Media
E-knjiga
268
Stranica
reportOcene i recenzije nisu verifikovane Saznajte više
O ovoj e-knjizi
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.
Ocenite ovu e-knjigu
Javite nam svoje mišljenje.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinhronizuje sa nalogom i omogućava vam da čitate onlajn i oflajn gde god da se nalazite.
Laptopovi i računari
Možete da slušate audio-knjige kupljene na Google Play-u pomoću veb-pregledača na računaru.
E-čitači i drugi uređaji
Da biste čitali na uređajima koje koriste e-mastilo, kao što su Kobo e-čitači, treba da preuzmete fajl i prenesete ga na uređaj. Pratite detaljna uputstva iz centra za pomoć da biste preneli fajlove u podržane e-čitače.
