Pages that link to "Item:Q5259532"

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

Displayed 50 items.

• Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) ‎ (← links)
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) ‎ (← links)
• Optimal CUR Matrix Decompositions (Q2968164) ‎ (← links)
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) ‎ (← links)
• Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) ‎ (← links)
• Communication is Bounded by Root of Rank (Q3177758) ‎ (← links)
• Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807) ‎ (← links)
• Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices (Q3177810) ‎ (← links)
• The Power of Localization for Efficiently Learning Linear Separators with Noise (Q3177877) ‎ (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) ‎ (← links)
• Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) ‎ (← links)
• The Matching Polytope has Exponential Extension Complexity (Q4640350) ‎ (← links)
• Fingerprinting codes and the price of approximate differential privacy (Q5259533) ‎ (← links)
• Analyze gauss (Q5259534) ‎ (← links)
• Private matchings and allocations (Q5259535) ‎ (← links)
• Rounding sum-of-squares relaxations (Q5259536) ‎ (← links)
• Constant factor approximation for balanced cut in the PIE model (Q5259537) ‎ (← links)
• Entropy, optimization and counting (Q5259538) ‎ (← links)
• Polynomial bounds for the grid-minor theorem (Q5259539) ‎ (← links)
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) ‎ (← links)
• Cops, robbers, and threatening skeletons (Q5259541) ‎ (← links)
• Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (Q5259543) ‎ (← links)
• On derandomizing algorithms that err extremely rarely (Q5259544) ‎ (← links)
• Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (Q5259545) ‎ (← links)
• Lower bounds for depth 4 formulas computing iterated matrix multiplication (Q5259546) ‎ (← links)
• The limits of depth reduction for arithmetic formulas (Q5259547) ‎ (← links)
• A super-polynomial lower bound for regular arithmetic formulas (Q5259548) ‎ (← links)
• A characterization of locally testable affine-invariant properties via decomposition theorems (Q5259549) ‎ (← links)
• L _p -testing (Q5259550) ‎ (← links)
• Turnstile streaming algorithms might as well be linear sketches (Q5259551) ‎ (← links)
• Linear time construction of compressed text indices in compact space (Q5259552) ‎ (← links)
• Formulas vs. circuits for small distance connectivity (Q5259554) ‎ (← links)
• Toward better formula lower bounds (Q5259555) ‎ (← links)
• Breaking the minsky-papert barrier for constant-depth circuits (Q5259556) ‎ (← links)
• Economic efficiency requires interaction (Q5259557) ‎ (← links)
• The sample complexity of revenue maximization (Q5259558) ‎ (← links)
• Optimal competitive auctions (Q5259559) ‎ (← links)
• Homological product codes (Q5259561) ‎ (← links)
• A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563) ‎ (← links)
• Primal beats dual on online packing LPs in the random-order model (Q5259564) ‎ (← links)
• Competitive algorithms from competitive equilibria (Q5259565) ‎ (← links)
• Minimum bisection is fixed parameter tractable (Q5259566) ‎ (← links)
• An efficient parallel solver for SDD linear systems (Q5259567) ‎ (← links)
• Solving SDD linear systems in nearly <i>m</i> log ^1/2 <i>n</i> time (Q5259568) ‎ (← links)
• From hierarchical partitions to hierarchical covers (Q5259570) ‎ (← links)
• Shortest paths on polyhedral surfaces and terrains (Q5259571) ‎ (← links)
• Embedding and canonizing graphs of bounded genus in logspace (Q5259572) ‎ (← links)
• Testing surface area with arbitrary accuracy (Q5259573) ‎ (← links)
• Coin flipping of <i>any</i> constant bias implies one-way functions (Q5259574) ‎ (← links)
• Infinite randomness expansion with a constant number of devices (Q5259577) ‎ (← links)