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.

Fourier Sparsity of GF(2) Polynomials: Label: en
On Expressive Power of Regular Expressions over Infinite Orders: Label: en
Representations of Analytic Functions and Weihrauch Degrees: Label: en
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions: Label: en
The Hardest Language for Conjunctive Grammars: Label: en
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems: Label: en
Depth-4 Identity Testing and Noether’s Normalization Lemma: Label: en
Algorithmic Statistics: Normal Objects and Universal Models: Label: en
Sums of Read-Once Formulas: How Many Summands Suffice?: Label: en
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy: Label: en
Level Two of the Quantifier Alternation Hierarchy over Infinite Words: Label: en
On Slepian–Wolf Theorem with Interaction: Label: en
Subclasses of Baxter Permutations Based on Pattern Avoidance: Label: en
Graph Editing to a Given Degree Sequence: Label: en
On Approximating (Connected) 2-Edge Dominating Set by a Tree: Label: en
Affine Computation and Affine Automaton: Label: en
Online Bounded Analysis: Label: en
Compositional Design of Stochastic Timed Automata: Label: en
Computing and Listing st-Paths in Public Transportation Networks: Label: en
Max-Closed Semilinear Constraint Satisfaction: Label: en
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing: Label: en
The Next Whisky Bar: Label: en
Algorithmic Decidability of Engel’s Property for Automaton Groups: Label: en
Sensitivity Versus Certificate Complexity of Boolean Functions: Label: en
On High-Quality Synthesis: Label: en
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals: Label: en
Weighted Rooted Trees: Fat or Tall?: Label: en
The Untold Story of $$\mathsf {SBP}$$: Label: en
On Subquadratic Derivational Complexity of Semi-Thue Systems: Label: en
Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs: Label: en
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels: Label: en
On Computing the Hamiltonian Index of Graphs: Label: en
On the Transformation of LL(k)-linear Grammars to LL(1)-linear: Label: en
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters: Label: en
Speedable Left-c.e. Numbers: Label: en
The Subtrace Order and Counting First-Order Logic: Label: en
Optimal Skeleton Huffman Trees Revisited: Label: en
The Power of Leibniz-Like Functions as Oracles: Label: en
Parameterized Complexity of Fair Feedback Vertex Set Problem: Label: en
Computational Hardness of Multidimensional Subtraction Games: Label: en
On the Parameterized Complexity of the Expected Coverage Problem: Label: en
Randomized and Symmetric Catalytic Computation: Label: en
On the Decision Tree Complexity of Threshold Functions: Label: en
On Embeddability of Unit Disk Graphs onto Straight Lines: Label: en
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata: Label: en
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics: Label: en
Definable Subsets of Polynomial-Time Algebraic Structures: Label: en
The Normalized Algorithmic Information Distance Can Not Be Approximated: Label: en
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter: Label: en
Faster 2-Disjoint-Shortest-Paths Algorithm: Label: en