Coverart for item
The Resource Descriptive Complexity, by Neil Immerman

Descriptive Complexity, by Neil Immerman

Label
Descriptive Complexity
Title
Descriptive Complexity
Statement of responsibility
by Neil Immerman
Creator
Subject
Language
eng
Summary
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
Member of
http://library.link/vocab/creatorName
Immerman, Neil
Dewey number
004.0151
Index
no index present
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Graduate Texts in Computer Science,
http://library.link/vocab/subjectName
  • Computer science
  • Information theory
  • Information systems
  • Logic, Symbolic and mathematical
Label
Descriptive Complexity, by Neil Immerman
Instantiates
Publication
Antecedent source
file reproduced from original
Color
mixed
Contents
Introduction -- Background in Logic -- Background in Complexity -- First-Order Reductions -- Inductive Definitions -- Parallelism -- Ehrenfeucht-Fraisse Games -- Second-Order Logic and Fagin's Theorem -- Second-Order Lower Bounds -- Complementation and Transitive Closure -- Polynomial Space -- Uniformity and Precomputation -- The Role of Ordering -- Lower Bounds -- Applications -- Conclusions and Future Directions
Control code
ocn853271745
Dimensions
unknown
Extent
1 online resource (xvi, 268 pages)
File format
unknown
Form of item
online
Isbn
9781461205395
Level of compression
uncompressed
Note
SpringerLink
Quality assurance targets
unknown
Reformatting quality
access
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)853271745
Label
Descriptive Complexity, by Neil Immerman
Publication
Antecedent source
file reproduced from original
Color
mixed
Contents
Introduction -- Background in Logic -- Background in Complexity -- First-Order Reductions -- Inductive Definitions -- Parallelism -- Ehrenfeucht-Fraisse Games -- Second-Order Logic and Fagin's Theorem -- Second-Order Lower Bounds -- Complementation and Transitive Closure -- Polynomial Space -- Uniformity and Precomputation -- The Role of Ordering -- Lower Bounds -- Applications -- Conclusions and Future Directions
Control code
ocn853271745
Dimensions
unknown
Extent
1 online resource (xvi, 268 pages)
File format
unknown
Form of item
online
Isbn
9781461205395
Level of compression
uncompressed
Note
SpringerLink
Quality assurance targets
unknown
Reformatting quality
access
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)853271745

Library Locations

    • InternetBorrow it
      Albany, Auckland, 0632, NZ
Processing Feedback ...