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
- scientific article; zbMATH DE number 1542049 (Why is no real title available?)
- Model Checking FO(R) over One-Counter Processes and beyond
- On low for speed oracles
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts
- Ontologies and Databases: The DL-Lite Approach
- A game-semantic model of computation
- scientific article; zbMATH DE number 4090803 (Why is no real title available?)
- Quantifier elimination for counting extensions of Presburger arithmetic
- Basic complexity
- Complexity and decidability
- Minimisation in logical form
- Parameterized resiliency problems
- On pure space vs catalytic space
- On pure space vs catalytic space
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Metric structures and probabilistic computation
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Reasoning on data words over numeric domains
- Document spanners: from expressive power to decision problems
- On the complexity of the quantified bit-vector arithmetic with binary encoding
- Games for query inseparability of description logic knowledge bases
- The domino problem is undecidable on every rhombus subshift
- Expressiveness and static analysis of extended conjunctive regular path queries
- How hard is positive quantification?
- Inhabitation of Low-Rank Intersection Types
- On the complexity of two-dimensional signed majority cellular automata
- scientific article; zbMATH DE number 6164359 (Why is no real title available?)
- On low for speed oracles
- Least and greatest solutions of equations over sets of integers
- Adding Guarded Constructions to the Syllogistic
- Infinitude of primes using formal languages
- Deciding Boolean algebra with Presburger arithmetic
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)
