STOC24 4 C 3 Lower bounds for regular resolution over parities

preview_player
Показать описание

  1. SIGACT EC
Рекомендации по теме
STOC24 4 C 0:23:37

STOC24 4 C 3 Lower bounds for regular resolution over parities

STOC24 3 C 0:20:34

STOC24 3 C 4 Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice Based SNARKs

STOC24 3 A 0:24:04

STOC24 3 A 4 Approximating Small Sparse Cuts

STOC24 4 D 0:19:15

STOC24 4 D 1 Optimization with pattern avoiding input

STOC24 4 D 0:15:29

STOC24 4 D 3 Packing even directed circuits quarter integrally

STOC24 4 C 0:27:29

STOC24 4 C 1 Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography

STOC24 2 C 0:16:25

STOC24 2 C 5 Near Optimal Mean Estimation with Unknown, Heteroskedastic Variances

STOC24 10 A 0:20:54

STOC24 10 A 1 On Optimal Coreset Construction for Euclidean k,z clustering

STOC24 3 B 0:15:20

STOC24 3 B 4 Robust recovery for stochastic block models, simplified and generalized

STOC24 11 D 0:24:01

STOC24 11 D 4 Explicit Codes for Poly Size Circuits and Functions that are Hard to Sample on Low Ent

STOC24 6 C 0:14:07

STOC24 6 C 2 Optimal Non Adaptive Tolerant Junta Testing via Local Estimators

STOC24 8 C 0:22:05

STOC24 8 C 3 The Power of Adaptivity in Quantum Query Algorithms

STOC24 11 C 0:27:56

STOC24 11 C 5 Characterizing Direct Product Testing via Coboundary Expansion

STOC24 4 D 0:16:46

STOC24 4 D 4 Edge Disjoint Paths in Eulerian Digraphs

STOC24 11 B 0:25:09

STOC24 11 B 5 Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond

STOC24 10 B 0:13:57

STOC24 10 B 4 Sampling Proper Colorings on Line Graphs Using 1+o1Delta Colors

STOC24 7 B 0:24:34

STOC24 7 B 4 Fair Division via Quantile Shares

STOC24 3 D 0:17:45

STOC24 3 D 4 Limitations of Stochastic Selection Problems with Pairwise Independent Priors

STOC24 4 B 0:15:31

STOC24 4 B 4 Quantum Time Space Tradeoffs for Matrix Problems

STOC24 11 B 0:24:34

STOC24 11 B 4 No distributed quantum advantage for approximate graph coloring

STOC24 3 A 0:16:57

STOC24 3 A 5 Better coloring of 3-colorable graphs

STOC24 6 A 0:24:59

STOC24 6 A 1 Revisiting Local Computation of PageRank Simple and Optimal

STOC24 8 D 0:24:57

STOC24 8 D 4 Combinatorial Characterizations of Monadically NIP Graph Classes

STOC24 7 D 0:23:32

STOC24 7 D 3 An optimal tradeoff between entanglement and copy complexity for state tomography