Theory of computation.
Turing machinesCompletenessComplexity classesLower boundsHierarchiesTheory of computingModels of computationTextbookComputational difficulty of problems
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)
- Theory of computation.
- scientific article; zbMATH DE number 2062344
- Theory of computation
- scientific article; zbMATH DE number 194974
- scientific article; zbMATH DE number 6164359
- scientific article; zbMATH DE number 1052322
- Computability and complexity theory.
- scientific article; zbMATH DE number 5595162
- Computability theory
- Computability theory
- Least and greatest solutions of equations over sets of integers
- Games for query inseparability of description logic knowledge bases
- The domino problem is undecidable on every rhombus subshift
- On low for speed oracles
- On the complexity of the quantified bit-vector arithmetic with binary encoding
- Parameterized resiliency problems
- Quantifier elimination for counting extensions of Presburger arithmetic
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Metric structures and probabilistic computation
- A game-semantic model of computation
- On low for speed oracles
- From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
- Complexity and decidability
- On pure space vs catalytic space
- On pure space vs catalytic space
- Basic complexity
- On the complexity of two-dimensional signed majority cellular automata
- Inhabitation of Low-Rank Intersection Types
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Minimisation in logical form
- Document spanners: from expressive power to decision problems
- Infinitude of primes using formal languages
- Kolmogorov's Calculus of Problems and its Legacy
- Adding Guarded Constructions to the Syllogistic
- scientific article; zbMATH DE number 1542049 (Why is no real title available?)
- scientific article; zbMATH DE number 4090803 (Why is no real title available?)
- Model Checking FO(R) over One-Counter Processes and beyond
- Deciding Boolean algebra with Presburger arithmetic
- Being polite is not enough (and other limits of theory combination)
- Ontologies and Databases: The DL-Lite Approach
- Alternating Turing machines and the analytical hierarchy
- Identifying tractable quantified temporal constraints within Ord-Horn
- scientific article; zbMATH DE number 6164359 (Why is no real title available?)
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Reasoning on data words over numeric domains
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts
- How hard is positive quantification?
- Solving quantified linear arithmetic by counterexample-guided instantiation
- An introduction to the theory of linear integer arithmetic (invited paper)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- Expressiveness and static analysis of extended conjunctive regular path queries
This page was built for publication: Theory of computation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492014)
