The following pages link to Theory of computation. (Q2492014):
Displaying 25 items.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts (Q494068) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- On the complexity of the quantified bit-vector arithmetic with binary encoding (Q1708270) (← links)
- On low for speed oracles (Q2009647) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
- On Low for Speed Oracles (Q3304109) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Inhabitation of Low-Rank Intersection Types (Q3637206) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- Infinitude of Primes Using Formal Languages (Q4685121) (← links)
- Adding Guarded Constructions to the Syllogistic (Q5015968) (← links)
- How Hard Is Positive Quantification? (Q5278190) (← links)
- On pure space vs catalytic space (Q5918608) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
- On pure space vs catalytic space (Q5970816) (← links)
