The following pages link to (Q4227581):
Displaying 50 items.
- Relativizing small complexity classes and their theories (Q260396) (← links)
- Complexity of model checking for reaction systems (Q264544) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- First-order under-approximations of consistent query answers (Q518631) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- On the expressive power of monadic least fixed point logic (Q817849) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Counter machines and distributed automata -- a story about exchanging space and time (Q1656682) (← links)
- Second-order propositional modal logic: expressiveness and completeness results (Q1731834) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- IF modal logic and classical negation (Q2016064) (← links)
- On the expressiveness of \textsc{Lara}: a proposal for unifying linear and relational algebra (Q2084947) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
