Pages that link to "Item:Q5415460"

The following pages link to Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Q5415460):

Displaying 50 items.

• Learning Poisson binomial distributions (Q2345953) (← links)
• Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
• Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
• Quantum money from hidden subspaces (Q3191578) (← links)
• Faster approximate multicommodity flow using quadratically coupled flows (Q5415461) (← links)
• When the cut condition is enough (Q5415462) (← links)
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
• Certifiable quantum dice (Q5415465) (← links)
• Span programs for functions with constant-sized 1-certificates (Q5415466) (← links)
• The cell probe complexity of dynamic range counting (Q5415467) (← links)
• Linear vs. semidefinite extended formulations (Q5415468) (← links)
• Matroid prophet inequalities (Q5415470) (← links)
• Online matching with concave returns (Q5415471) (← links)
• Computing a nonnegative matrix factorization -- provably (Q5415472) (← links)
• On identity testing of tensors, low-rank recovery and compressed sensing (Q5415473) (← links)
• Structure theorem and isomorphism test for graphs with excluded topological subgraphs (Q5415474) (← links)
• Short proofs for the determinant identities (Q5415475) (← links)
• Time-space tradeoffs in resolution (Q5415477) (← links)
• On the virtue of succinct proofs (Q5415478) (← links)
• Determinism versus nondeterminism with arithmetic tests and computation (Q5415479) (← links)
• Solution of the propeller conjecture in R ³ (Q5415480) (← links)
• 2 ^{log1-ε <i>n</i>} hardness for the closest vector problem with preprocessing (Q5415481) (← links)
• A new point of NP-hardness for unique games (Q5415482) (← links)
• Hypercontractivity, sum-of-squares proofs, and their applications (Q5415483) (← links)
• From irreducible representations to locally decodable codes (Q5415484) (← links)
• Folded codes from function field towers and improved optimal rate list decoding (Q5415485) (← links)
• Subspace evasive sets (Q5415486) (← links)
• Edge transitive ramanujan graphs and symmetric LDPC good codes (Q5415487) (← links)
• Approximation algorithms for semi-random partitioning problems (Q5415488) (← links)
• A near-linear time ε-approximation algorithm for geometric bipartite matching (Q5415489) (← links)
• Using petal-decompositions to build a low stretch spanning tree (Q5415490) (← links)
• Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
• Prior-free auctions with ordered bidders (Q5415492) (← links)
• On the limits of black-box reductions in mechanism design (Q5415493) (← links)
• Budget feasible mechanism design (Q5415494) (← links)
• An algorithmic characterization of multi-dimensional mechanisms (Q5415495) (← links)
• Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (Q5415496) (← links)
• Tight bounds for monotone switching networks via fourier analysis (Q5415497) (← links)
• Interactive information complexity (Q5415498) (← links)
• The multiparty communication complexity of set disjointness (Q5415499) (← links)
• Fast matrix rank algorithms and applications (Q5415500) (← links)
• Nearly optimal sparse fourier transform (Q5415501) (← links)
• Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (Q5415502) (← links)
• Optimal online buffer scheduling for block devices (Q5415503) (← links)
• Jacobian hits circuits (Q5415504) (← links)
• Separating multilinear branching programs and formulas (Q5415505) (← links)
• Reconstruction of depth-4 multilinear circuits with top fan-in 2 (Q5415506) (← links)
• Affine projections of polynomials (Q5415507) (← links)
• The traveling salesman problem (Q5415508) (← links)
• On vertex sparsifiers with Steiner nodes (Q5415509) (← links)