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 #51 to #100.

Stronger L ₂ /L ₂ compressed sensing; without iterating: Label: en
An optimal space lower bound for approximating MAX-CUT: Label: en
Polynomial pass lower bounds for graph streaming algorithms: Label: en
O (log ² k / log log k )-approximation algorithm for directed Steiner tree: Label: en
Breaking quadratic time for small vertex connectivity and an approximation scheme: Label: en
The number of minimum k -cuts: improving the Karger-Stein bound: Label: en
A quantum-inspired classical algorithm for recommendation systems: Label: en
Quantum weak coin flipping: Label: en
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics: Label: en
The parallel repetition of non-signaling games: counterexamples and dichotomy: Label: en
Planar graphs of bounded degree have bounded queue number: Label: en
Polylogarithmic approximation for Euler genus on bounded degree graphs: Label: en
Planar diameter via metric compression: Label: en
Almost optimal distance oracles for planar graphs: Label: en
Approximation algorithms for minimum norm and ordered optimization problems: Label: en
Dynamic set cover: improved algorithms and lower bounds: Label: en
Unconstrained submodular maximization with constant adaptive complexity: Label: en
Submodular maximization with matroid and packing constraints in parallel: Label: en
Parallelizing greedy for submodular set function maximization in matroids and beyond: Label: en
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model: Label: en
A strongly polynomial algorithm for linear exchange markets: Label: en
The log-approximate-rank conjecture is false: Label: en
Bootstrapping results for threshold circuits “just beyond” known lower bounds: Label: en
The reachability problem for Petri nets is not elementary: Label: en
Oracle separation of BQP and PH: Label: en
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid: Label: en
A unifying method for the design of algorithms canonizing combinatorial objects: Label: en
Canonical form for graphs in quasipolynomial time: preliminary report: Label: en
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective: Label: en
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes: Label: en
Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log _𝐾-1 𝑁 for each 𝐾-1 a prime power: Label: en
New polynomial delay bounds for maximal subgraph enumeration by proximity search: Label: en
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles: Label: en
Achieving optimal backlog in multi-processor cup games: Label: en
The online 𝑘-taxi problem: Label: en
On a generalization of iterated and randomized rounding: Label: en
How to delegate computations publicly: Label: en
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir: Label: en
Weak zero-knowledge beyond the black-box barrier: Label: en
Fiat-Shamir: from practice to theory: Label: en
Dynamic sampling from graphical models: Label: en
Optimal terminal dimensionality reduction in Euclidean space: Label: en
A universal sampling method for reconstructing signals with simple Fourier transforms: Label: en
Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma: Label: en
Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering: Label: en
On approximating the covering radius and finding dense lattice subspaces: Label: en
Algorithmic Pirogov-Sinai theory: Label: en
Lower bounds for external memory integer sorting via network coding: Label: en
Why extension-based proofs fail: Label: en
An exponential lower bound on the sub-packetization of MSR codes: Label: en