Pages that link to "Item:Q5212741"
From MaRDI portal
The following pages link to Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Q5212741):
Displayed 50 items.
- Testing graphs in vertex-distribution-free models (Q5212794) (← links)
- Testing unateness nearly optimally (Q5212796) (← links)
- Bridging between 0/1 and linear programming via random walks (Q5212799) (← links)
- Faster <i>k</i> -SAT algorithms using biased-PPSZ (Q5212800) (← links)
- CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801) (← links)
- Algebraic approach to promise constraint satisfaction (Q5212802) (← links)
- Fooling polytopes (Q5212803) (← links)
- Pseudorandom generators for width-3 branching programs (Q5212804) (← links)
- The complexity of splitting necklaces and bisecting ham sandwiches (Q5212805) (← links)
- The communication complexity of local search (Q5212806) (← links)
- Settling the sample complexity of single-parameter revenue maximization (Q5212807) (← links)
- Tight approximation ratio of anonymous pricing (Q5212808) (← links)
- Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items (Q5212809) (← links)
- Near-linear time insertion-deletion codes and (1+ <i>ε</i> )-approximating edit distance via indexing (Q5212810) (← links)
- 1+ <i>ε</i> approximation of tree edit distance in quadratic time (Q5212811) (← links)
- Optimal sequence length requirements for phylogenetic tree reconstruction with indels (Q5212812) (← links)
- Computing quartet distance is equivalent to counting 4-cycles (Q5212813) (← links)
- Local decodability of the Burrows-Wheeler transform (Q5212815) (← links)
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure (Q5212816) (← links)
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions (Q5212817) (← links)
- Efficient profile maximum likelihood for universal symmetric property estimation (Q5212818) (← links)
- Communication complexity of estimating correlations (Q5212819) (← links)
- Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications) (Q5212820) (← links)
- Capacity lower bound for the Ising perceptron (Q5212821) (← links)
- Learning restricted Boltzmann machines via influence maximization (Q5212822) (← links)
- Non-Gaussian component analysis using entropy methods (Q5212824) (← links)
- Private PAC learning implies finite Littlestone dimension (Q5212825) (← links)
- Competitively chasing convex bodies (Q5212826) (← links)
- Beyond the low-degree algorithm: mixtures of subcubes and their applications (Q5212827) (← links)
- Regression from dependent observations (Q5212828) (← links)
- Memory-sample tradeoffs for linear regression with small error (Q5212830) (← links)
- Flows in almost linear time via adaptive preconditioning (Q5212831) (← links)
- Fully dynamic spectral vertex sparsifiers and applications (Q5212832) (← links)
- Spectral methods from tensor networks (Q5212833) (← links)
- Solving linear programs in the current matrix multiplication time (Q5212834) (← links)
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max (Q5212835) (← links)
- Optimal succinct rank data structure via approximate nonnegative tensor decomposition (Q5212836) (← links)
- Static data structure lower bounds imply rigidity (Q5212837) (← links)
- An exponential lower bound on the sub-packetization of MSR codes (Q5212838) (← links)
- Why extension-based proofs fail (Q5212839) (← links)
- Lower bounds for external memory integer sorting via network coding (Q5212840) (← links)
- Algorithmic Pirogov-Sinai theory (Q5212841) (← links)
- On approximating the covering radius and finding dense lattice subspaces (Q5212842) (← links)
- Performance of Johnson-Lindenstrauss transform for <i>k</i> -means and <i>k</i> -medians clustering (Q5212843) (← links)
- Oblivious dimension reduction for <i>k</i> -means: beyond subspaces and the Johnson-Lindenstrauss lemma (Q5212844) (← links)
- A universal sampling method for reconstructing signals with simple Fourier transforms (Q5212845) (← links)
- Optimal terminal dimensionality reduction in Euclidean space (Q5212846) (← links)
- Dynamic sampling from graphical models (Q5212847) (← links)
- Fiat-Shamir: from practice to theory (Q5212848) (← links)
- Weak zero-knowledge beyond the black-box barrier (Q5212849) (← links)