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.

Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices: Label: en
Algebraic algorithms for fractional linear matroid parity via noncommutative rank: Label: en
Fitting metrics and ultrametrics with minimum disagreements: Label: en
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion: Label: en
Want to gather? No need to chatter!: Label: en
On min sum vertex cover and generalized min sum set cover: Label: en
Zero-knowledge proof systems for QMA: Label: en
Communication complexity of discrete fair division: Label: en
Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough: Label: en
Special section on the sixty-first annual IEEE symposium on foundations of computer science (2020): Label: en
Symmetries, graph properties, and quantum speedups: Label: en
Constant depth formula and partial function versions of MCSP are hard: Label: en
A parameterized approximation scheme for min \(k\)-cut: Label: en
Prophet secretary for combinatorial auctions and matroids: Label: en
Twin-width. III: Max independent set, min dominating set, and coloring: Label: en
Small but unwieldy: a lower bound on adjacency labels for small classes: Label: en
Internal pattern matching queries in a text and applications: Label: en
An improved upper bound for the universal TSP on the grid: Label: en
Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms: Label: en
Counting subgraphs in somewhere dense graphs: Label: en
Complete characterization of fairness in secure two-party computation of Boolean functions: Label: en
Optimal resizable arrays: Label: en
Complexity classification transfer for CSPs via algebraic products: Label: en
Traversing combinatorial 0/1-polytopes via optimization: Label: en
Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue: Label: en
PTAS for minimum cost multicovering with disks: Label: en
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows: Label: en
Algorithms for subpath convex hull queries and ray-shooting among segments: Label: en
Fast FPT-approximation of branchwidth: Label: en
Revisionist simulations: a new approach to proving space lower bounds: Label: en
Economical convex coverings and applications: Label: en
On the privacy of noisy stochastic gradient descent for convex optimization: Label: en
Two variable logic with ultimately periodic counting: Label: en
On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing: Label: en
How to trap a gradient flow: Label: en
Proof complexity and the binary encoding of combinatorial principles: Label: en
Adwords in a panorama: Label: en
Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?: Label: en
Induced subgraphs of bounded treewidth and the container method: Label: en
Cluster before you hallucinate: node-capacitated network design and energy efficient routing: Label: en
Further collapses in \(\mathsf{TFNP}\): Label: en
Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph: Label: en
Rigid matrices from rectangular PCPs: Label: en
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics: Label: en
Online Edge Coloring via Tree Recurrences and Correlation Decay: Label: en
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs: Label: en
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid: Label: en
An ETH-Tight Exact Algorithm for Euclidean TSP: Label: en
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree: Label: en
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius: Label: en