Theory of computation.

From MaRDI portal
Publication:2492014

zbMath1102.68025MaRDI QIDQ2492014

Dexter Kozen

Publication date: 31 May 2006

Published in: Texts in Computer Science (Search for Journal in Brave)




Related Items (27)

How Hard Is Positive Quantification?Document spanners: from expressive power to decision problemsDeciding Boolean algebra with Presburger arithmeticOn the complexity of two-dimensional signed majority cellular automataOn Low for Speed OraclesExpressiveness and static analysis of extended conjunctive regular path queriesThe domino problem is undecidable on every rhombus subshiftSolving quantified linear arithmetic by counterexample-guided instantiationLogic-based ontology comparison and module extraction, with an application to DL-LiteQuantifier elimination for counting extensions of Presburger arithmeticOn the complexity of the quantified bit-vector arithmetic with binary encodingUpper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)Hardness of conjugacy, embedding and factorization of multidimensional subshiftsMetric structures and probabilistic computationOn low for speed oraclesEhrenfeucht-Fraïssé goes automatic for real additionInfinitude of Primes Using Formal LanguagesLeast and greatest solutions of equations over sets of integersOn pure space vs catalytic spaceInhabitation of Low-Rank Intersection TypesOntologies and Databases: The DL-Lite ApproachModel Checking FO(R) over One-Counter Processes and beyondA game-semantic model of computationParameterized resiliency problemsOn pure space vs catalytic spaceAdding Guarded Constructions to the SyllogisticGames for query inseparability of description logic knowledge bases




This page was built for publication: Theory of computation.