Pages that link to "Item:Q3773337"
From MaRDI portal
The following pages link to Languages that Capture Complexity Classes (Q3773337):
Displayed 50 items.
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- Languages represented by Boolean formulas (Q290253) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- A generalized closure and complement phenomenon (Q795354) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- First-order spectra with one variable (Q909462) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- The method of forced enumeration for nondeterministic automata (Q1099620) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- Complete problems for symmetric logspace involving free groups (Q1183484) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- A survey of space complexity (Q1193412) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- An extension of fixpoint logic with a symmetry-based choice construct (Q1271477) (← links)
- Reflective relational machines (Q1271557) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)