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 49 results in range #51 to #99.

Affine Consistency and the Complexity of Semilinear Constraints: Label: en
Alternating Vector Addition Systems with States: Label: en
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis: Label: en
Size-Change Abstraction and Max-Plus Automata: Label: en
Knocking Out P k -free Graphs: Label: en
An Algebraic Characterization of Unary Two-Way Transducers: Label: en
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem: Label: en
On the Complexity of List Ranking in the Parallel External Memory Model: Label: en
Classifying Recognizable Infinitary Trace Languages Using Word Automata: Label: en
Lower Bounds for Splittings by Linear Combinations: Label: en
Cyclic Complexity of Words: Label: en
New Results for Non-Preemptive Speed Scaling: Label: en
Subword Complexity and Decomposition of the Set of Factors: Label: en
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity: Label: en
Universal Lyndon Words: Label: en
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth: Label: en
Advances in Parametric Real-Time Reasoning: Label: en
Editing to a Connected Graph of Given Degrees: Label: en
Alternating Parity Krivine Automata: Label: en
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes: Label: en
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules: Label: en
Intersection Graphs of L-Shapes and Segments in the Plane: Label: en
A Reconfigurations Analogue of Brooks’ Theorem: Label: en
Asymptotic Monadic Second-Order Logic: Label: en
Streaming Kernelization: Label: en
A Logical Characterization of Timed (non-)Regular Languages: Label: en
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty: Label: en
Minimum Bisection Is NP-hard on Unit Disk Graphs: Label: en
Sofic-Dyck Shifts: Label: en
A Note on the Minimum Distance of Quantum LDPC Codes: Label: en
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group: Label: en
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes: Label: en
Existence of Secure Equilibrium in Multi-player Games with Perfect Information: Label: en
Probabilistic Analysis of Power Assignments: Label: en
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?: Label: en
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth: Label: en
Communication Complexity Theory: Thirty-Five Years of Set Disjointness: Label: en
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields: Label: en
Random Deterministic Automata: Label: en
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas: Label: en
Partial-Observation Stochastic Reachability and Parity Games: Label: en
Combinatorial Voter Control in Elections: Label: en
Dual Connectedness of Edge-Bicolored Graphs and Beyond: Label: en
The Relationship between Multiplicative Complexity and Nonlinearity: Label: en
On the Complexity of Some Ordering Problems: Label: en
The Price of Envy-Freeness in Machine Scheduling: Label: en
Minimum Planar Multi-sink Cuts with Connectivity Priors: Label: en
On Unification of QBF Resolution-Based Calculi: Label: en
Network-Based Dissolution: Label: en