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):
Displaying 50 items.
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid (Q5212742) (← links)
- Oracle separation of BQP and PH (Q5212743) (← links)
- The reachability problem for Petri nets is not elementary (Q5212744) (← links)
- Bootstrapping results for threshold circuits “just beyond” known lower bounds (Q5212745) (← links)
- The log-approximate-rank conjecture is false (Q5212746) (← links)
- A strongly polynomial algorithm for linear exchange markets (Q5212747) (← links)
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model (Q5212748) (← links)
- Parallelizing greedy for submodular set function maximization in matroids and beyond (Q5212749) (← links)
- Submodular maximization with matroid and packing constraints in parallel (Q5212750) (← links)
- Unconstrained submodular maximization with constant adaptive complexity (Q5212751) (← links)
- Dynamic set cover: improved algorithms and lower bounds (Q5212753) (← links)
- Approximation algorithms for minimum norm and ordered optimization problems (Q5212754) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Planar diameter via metric compression (Q5212756) (← links)
- Polylogarithmic approximation for Euler genus on bounded degree graphs (Q5212757) (← links)
- Planar graphs of bounded degree have bounded queue number (Q5212758) (← links)
- The parallel repetition of non-signaling games: counterexamples and dichotomy (Q5212759) (← links)
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics (Q5212760) (← links)
- Quantum weak coin flipping (Q5212762) (← links)
- A quantum-inspired classical algorithm for recommendation systems (Q5212763) (← links)
- The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound (Q5212764) (← links)
- Breaking quadratic time for small vertex connectivity and an approximation scheme (Q5212766) (← links)
- <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (Q5212767) (← links)
- Polynomial pass lower bounds for graph streaming algorithms (Q5212768) (← links)
- An optimal space lower bound for approximating MAX-CUT (Q5212769) (← links)
- Stronger L <sub>2</sub> /L <sub>2</sub> compressed sensing; without iterating (Q5212770) (← links)
- Private selection from private candidates (Q5212771) (← links)
- The structure of optimal private tests for simple hypotheses (Q5212772) (← links)
- Gentle measurement of quantum states and differential privacy (Q5212773) (← links)
- Distributed exact weighted all-pairs shortest paths in near-linear time (Q5212774) (← links)
- Distributed edge connectivity in sublinear time (Q5212776) (← links)
- Towards the locality of Vizing’s theorem (Q5212777) (← links)
- Decremental strongly-connected components and single-source reachability in near-linear time (Q5212778) (← links)
- Dynamic low-stretch trees via dynamic low-diameter decompositions (Q5212779) (← links)
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780) (← links)
- Near-optimal lower bounds on the threshold degree and sign-rank of AC <sup>0</sup> (Q5212781) (← links)
- Reconstruction of non-degenerate homogeneous depth three circuits (Q5212782) (← links)
- Separating monotone VP and VNP (Q5212783) (← links)
- On the approximation resistance of balanced linear threshold functions (Q5212784) (← links)
- A fixed-depth size-hierarchy theorem for AC <sup>0</sup> [⊕] via the coin problem (Q5212785) (← links)
- DNF sparsification beyond sunflowers (Q5212786) (← links)
- Quantum Lovász local lemma: Shearer’s bound is tight (Q5212787) (← links)
- Quantum proof systems for iterated exponential time, and beyond (Q5212788) (← links)
- Good approximate quantum LDPC codes from spacetime circuit Hamiltonians (Q5212790) (← links)
- Hamiltonian simulation with nearly optimal dependence on spectral norm (Q5212791) (← links)
- Quantum state certification (Q5212792) (← links)
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits (Q5212793) (← links)
