| http://dbpedia.org/ontology/abstract
|
Descriptive Complexity is a book in mathem … Descriptive Complexity is a book in mathematical logic and computational complexity theory by Neil Immerman. It concerns descriptive complexity theory, an area in which the expressibility of mathematical properties using different types of logic is shown to be equivalent to their computability in different types of resource-bounded models of computation. It was published in 1999 by Springer-Verlag in their book series Graduate Texts in Computer Science.series Graduate Texts in Computer Science.
|
| http://dbpedia.org/ontology/wikiPageID
|
64040846
|
| http://dbpedia.org/ontology/wikiPageLength
|
5357
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
961988116
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/P_%28complexity%29 +
, http://dbpedia.org/resource/Transitive_closure +
, http://dbpedia.org/resource/NL_%28complexity%29 +
, http://dbpedia.org/resource/Category:1999_non-fiction_books +
, http://dbpedia.org/resource/Second-order_logic +
, http://dbpedia.org/resource/First-order_arithmetic +
, http://dbpedia.org/resource/Switching_lemma +
, http://dbpedia.org/resource/Cook%E2%80%93Levin_theorem +
, http://dbpedia.org/resource/L_%28complexity%29 +
, http://dbpedia.org/resource/Ehrenfeucht%E2%80%93Fra%C3%AFss%C3%A9_game +
, http://dbpedia.org/resource/PSPACE +
, http://dbpedia.org/resource/First-order_logic +
, http://dbpedia.org/resource/Mathematical_logic +
, http://dbpedia.org/resource/Category:Descriptive_complexity +
, http://dbpedia.org/resource/Springer-Verlag +
, http://dbpedia.org/resource/Least_fixed_point +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Database +
, http://dbpedia.org/resource/FO_%28complexity%29 +
, http://dbpedia.org/resource/Neil_Immerman +
, http://dbpedia.org/resource/Category:Mathematics_books +
, http://dbpedia.org/resource/NP_%28complexity%29 +
, http://dbpedia.org/resource/Formal_language +
, http://dbpedia.org/resource/Parallel_random-access_machine +
, http://dbpedia.org/resource/Model_checking +
, http://dbpedia.org/resource/BIT_predicate +
, http://dbpedia.org/resource/Descriptive_complexity_theory +
, http://dbpedia.org/resource/Polynomial_hierarchy +
, http://dbpedia.org/resource/Complete_%28complexity%29 +
, http://dbpedia.org/resource/Immerman%E2%80%93Szelepcs%C3%A9nyi_theorem +
, http://dbpedia.org/resource/Circuit_complexity +
, http://dbpedia.org/resource/Fagin%27s_theorem +
, http://dbpedia.org/resource/Complexity_class +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:About +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:R +
, http://dbpedia.org/resource/Template:Italic_title +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:1999_non-fiction_books +
, http://dbpedia.org/resource/Category:Descriptive_complexity +
, http://dbpedia.org/resource/Category:Mathematics_books +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Descriptive_Complexity?oldid=961988116&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Descriptive_Complexity +
|
| owl:sameAs |
http://dbpedia.org/resource/Descriptive_Complexity +
, https://global.dbpedia.org/id/Bygkt +
, http://www.wikidata.org/entity/Q96376265 +
|
| rdfs:comment |
Descriptive Complexity is a book in mathem … Descriptive Complexity is a book in mathematical logic and computational complexity theory by Neil Immerman. It concerns descriptive complexity theory, an area in which the expressibility of mathematical properties using different types of logic is shown to be equivalent to their computability in different types of resource-bounded models of computation. It was published in 1999 by Springer-Verlag in their book series Graduate Texts in Computer Science.series Graduate Texts in Computer Science.
|
| rdfs:label |
Descriptive Complexity
|
