Descriptive Complexity.pdf

Descriptive Complexity

Neil Immerman

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.

Descriptive complexity studies the relation between formal languages and computational resources (space and time) required to solve problems formulated in ...

9.21 MB DATEIGRÖSSE
1461268095 ISBN
Englisch SPRACHE
Descriptive Complexity.pdf

Technik

PC und Mac

Lesen Sie das eBook direkt nach dem Herunterladen über "Jetzt lesen" im Browser, oder mit der kostenlosen Lesesoftware Adobe Digital Editions.

iOS & Android

Für Tablets und Smartphones: Unsere Gratis tolino Lese-App

Andere eBook Reader

Laden Sie das eBook direkt auf dem Reader im Hugendubel.de-Shop herunter oder übertragen Sie es mit der kostenlosen Software Sony READER FOR PC/Mac oder Adobe Digital Editions.

Reader

Öffnen Sie das eBook nach der automatischen Synchronisation auf dem Reader oder übertragen Sie es manuell auf Ihr tolino Gerät mit der kostenlosen Software Adobe Digital Editions.

Aktuelle Bewertungen

avatar
Sofia Voigt

[1708.04845] The Descriptive Complexity of …

avatar
Matteo Müller

Descriptive Complexity of Finite Abelian Groups | …

avatar
Noel Schulze

Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic ... Descriptive Complexity. Computational complexity was originally defined in terms of the natural entities of time and space, and the term complexity was used to ...

avatar
Jason Lehmann

Descriptive Complexity by Neil Immerman - …

avatar
Jessica Kohmann

viewed as a logical account of average case complexity in a similar sense that our work gives a logical account of randomised complexity. There is a another logical approach to computational complexity, known as implicit computational complexity, which is quite dif-ferent from descriptive complexity theory. Mitchell, Mitchell, and Scedrov [28