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 35 results in range #51 to #85.

The multiparty communication complexity of set disjointness: Label: en
Interactive information complexity: Label: en
Tight bounds for monotone switching networks via fourier analysis: Label: en
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates: Label: en
An algorithmic characterization of multi-dimensional mechanisms: Label: en
Budget feasible mechanism design: Label: en
On the limits of black-box reductions in mechanism design: Label: en
Prior-free auctions with ordered bidders: Label: en
Using petal-decompositions to build a low stretch spanning tree: Label: en
A near-linear time ε-approximation algorithm for geometric bipartite matching: Label: en
Approximation algorithms for semi-random partitioning problems: Label: en
Edge transitive ramanujan graphs and symmetric LDPC good codes: Label: en
Subspace evasive sets: Label: en
Folded codes from function field towers and improved optimal rate list decoding: Label: en
From irreducible representations to locally decodable codes: Label: en
Hypercontractivity, sum-of-squares proofs, and their applications: Label: en
A new point of NP-hardness for unique games: Label: en
2 ^{log1-ε n} hardness for the closest vector problem with preprocessing: Label: en
Solution of the propeller conjecture in R ³: Label: en
Determinism versus nondeterminism with arithmetic tests and computation: Label: en
On the virtue of succinct proofs: Label: en
Time-space tradeoffs in resolution: Label: en
Short proofs for the determinant identities: Label: en
Structure theorem and isomorphism test for graphs with excluded topological subgraphs: Label: en
On identity testing of tensors, low-rank recovery and compressed sensing: Label: en
Computing a nonnegative matrix factorization -- provably: Label: en
Online matching with concave returns: Label: en
Matroid prophet inequalities: Label: en
Linear vs. semidefinite extended formulations: Label: en
The cell probe complexity of dynamic range counting: Label: en
Span programs for functions with constant-sized 1-certificates: Label: en
Certifiable quantum dice: Label: en
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives: Label: en
When the cut condition is enough: Label: en
Faster approximate multicommodity flow using quadratically coupled flows: Label: en