Pages that link to "Item:Q5271715"

The following pages link to Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Q5271715):

Displaying 50 items.

• Information-theoretic thresholds from the cavity method (Q1649349) (← links)
• Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
• The menu-size complexity of revenue approximation (Q2155903) (← links)
• Communication complexity of approximate Nash equilibria (Q2155907) (← links)
• A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061) (← links)
• (Q4977955) (redirect page) (← links)
• Twenty (simple) questions (Q4977956) (← links)
• Kolmogorov complexity version of Slepian-Wolf coding (Q4977957) (← links)
• Synchronization strings (Q4977959) (← links)
• Learning from untrusted data (Q4977960) (← links)
• Beating 1-1/e for ordered prophets (Q4977961) (← links)
• Kernel-based methods for bandit convex optimization (Q4977962) (← links)
• New hardness results for routing on disjoint paths (Q4977963) (← links)
• A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
• Finding even cycles faster via capped k-walks (Q4977965) (← links)
• Strongly refuting random CSPs below the spectral threshold (Q4977966) (← links)
• Sum of squares lower bounds for refuting any CSP (Q4977967) (← links)
• Bernoulli factories and black-box reductions in mechanism design (Q4977969) (← links)
• Simple mechanisms for subadditive buyers via duality (Q4977970) (← links)
• Stability of service under time-of-use pricing (Q4977971) (← links)
• Faster space-efficient algorithms for subset sum and k-sum (Q4977972) (← links)
• Homomorphisms are a good basis for counting small subgraphs (Q4977973) (← links)
• Lossy kernelization (Q4977974) (← links)
• Explicit, almost optimal, epsilon-balanced codes (Q4977975) (← links)
• Deciding parity games in quasipolynomial time (Q4977976) (← links)
• A weighted linear matroid parity algorithm (Q4977977) (← links)
• Exponential separation of quantum communication and classical information (Q4977978) (← links)
• Compression of quantum multi-prover interactive proofs (Q4977979) (← links)
• Hardness amplification for entangled games via anchoring (Q4977980) (← links)
• The computational complexity of ball permutations (Q4977982) (← links)
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation (Q4977983) (← links)
• Uniform sampling through the Lovasz local lemma (Q4977984) (← links)
• Approximate counting, the Lovasz local lemma, and inference in graphical models (Q4977985) (← links)
• Real stable polynomials and matroids: optimization and counting (Q4977986) (← links)
• A generalization of permanent inequalities and applications in counting and optimization (Q4977987) (← links)
• Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
• Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (Q4977990) (← links)
• Local max-cut in smoothed polynomial time (Q4977991) (← links)
• Algorithms for stable and perturbation-resilient problems (Q4977992) (← links)
• Area-convexity, l _∞ regularization, and undirected multicommodity flow (Q4977993) (← links)
• Pseudorandomness of ring-LWE for any ring and modulus (Q4977994) (← links)
• Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995) (← links)
• Average-case fine-grained hardness (Q4977996) (← links)
• Equivocating Yao (Q4977997) (← links)
• Removal lemmas with polynomial bounds (Q4977998) (← links)
• Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness (Q4977999) (← links)
• Online and dynamic algorithms for set cover (Q4978000) (← links)
• Online service with delay (Q4978002) (← links)
• The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n (Q4978003) (← links)
• On independent sets, 2-to-2 games, and Grassmann graphs (Q4978004) (← links)