The following pages link to (Q4227581):
Displaying 50 items.
- Local higher-order fixpoint iteration (Q2105477) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- On the expressive power of TeamLTL and first-order team logic over hyperproperties (Q2148802) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Emptiness problems for distributed automata (Q2182732) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- Two first-order logics of permutations (Q2299614) (← links)
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs (Q2309560) (← links)
- Descriptive complexity and revealed preference theory (Q2334833) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- Arity and alternation: a proper hierarchy in higher order logics (Q2385450) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- Computational complexities of axiomatic extensions of monoidal t-norm based logic (Q2391235) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Polynomial hierarchy graph properties in hybrid logic (Q2453580) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- Out of order quantifier elimination for standard quantified linear programs (Q2456614) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- The many faces of a translation (Q2581761) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- Division in logspace-uniform<i>NC</i><sup>1</sup> (Q2773023) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- (Q3121527) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary R (Q3185766) (← links)
- Squeezing Feasibility (Q3188242) (← links)
