Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Monadic Second-Order Logic with Arbitrary Monadic Predicates: Label: en
The Dynamic Descriptive Complexity of k-Clique: Label: en
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set: Label: en
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems: Label: en
$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability: Label: en
A Pumping Lemma for Two-Way Finite Transducers: Label: en
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity: Label: en
On Infinite Words Determined by Indexed Languages: Label: en
Zero Knowledge and Circuit Minimization: Label: en
Tight Bounds for Complementing Parity Automata: Label: en
Determinising Parity Automata: Label: en
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs: Label: en
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures: Label: en
On r-Simple k-Path: Label: en
Reachability in Pushdown Register Automata: Label: en
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions: Label: en
Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals: Label: en
Flexible Bandwidth Assignment with Application to Optical Networks: Label: en
Model Checking Concurrent Recursive Programs Using Temporal Logics: Label: en
The Two Queries Assumption and Arthur-Merlin Classes: Label: en
Monadic Datalog and Regular Tree Pattern Queries: Label: en
Deterministic Parameterized Algorithms for the Graph Motif Problem: Label: en
Complexity of Equivalence and Learning for Multiplicity Tree Automata: Label: en
Betweenness Centrality – Incremental and Faster: Label: en
Generalised Lyndon-Schützenberger Equations: Label: en
Inferring Strings from Lyndon Factorization: Label: en
Definability and Transformations for Cost Logics and Automatic Structures: Label: en
Traveling Salesman Problems in Temporal Graphs: Label: en
A Unifying Approach for Multistack Pushdown Automata: Label: en
An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games: Label: en
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality: Label: en
Document Retrieval with One Wildcard: Label: en
Undecidable Properties of Self-affine Sets and Multi-tape Automata: Label: en
The Monoid of Queue Actions: Label: en
On Coloring Resilient Graphs: Label: en
L ax F: Side Conditions and External Evidence as Monads: Label: en
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs: Label: en
On Upper and Lower Bounds on the Length of Alternating Towers: Label: en
Computational Complexity of Covering Three-Vertex Multigraphs: Label: en
Measure Properties of Game Tree Languages: Label: en
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata: Label: en
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic: Label: en
On the Clique Editing Problem: Label: en
Two Recursively Inseparable Problems for Probabilistic Automata: Label: en
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures: Label: en
Parameterized Approximations via d-Skew-Symmetric Multicut: Label: en
Relating Nominal and Higher-Order Rewriting: Label: en
Two Results about Quantum Messages: Label: en
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach: Label: en
Small Complexity Classes for Computable Analysis: Label: en