Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

An improved derandomization of the switching lemma: Label: en
Polynomial time deterministic identity testing algorithm for Σ ^[3] ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials: Label: en
New separations results for external information: Label: en
Iterated lower bound formulas: a diagonalization-based approach to proof complexity: Label: en
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly: Label: en
Automating algebraic proof systems is NP-hard: Label: en
Log-rank and lifting for AND-functions: Label: en
Sample-efficient proper PAC learning with approximate differential privacy: Label: en
A new analysis of differential privacy’s generalization guarantees (invited paper): Label: en
The ghost in the radiation: robust encodings of the black hole interior (invited paper): Label: en
Simplicity creates inequity: implications for fairness, stereotypes, and interpretability (invited paper): Label: en
Neural tangent kernel: convergence and generalization in neural networks (invited paper): Label: en
Chasing convex bodies with linear competitive ratio (invited paper): Label: en
A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper): Label: en
Climbing algorithms (invited talk): Label: en
Computational thinking in programming language and compiler design (keynote): Label: en
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path: Label: en
A full complexity dichotomy for immanant families: Label: en
Vertex deletion parameterized by elimination distance and even less: Label: en
Constant approximating k-clique is w[1]-hard: Label: en
Approximate Gomory–Hu tree is faster than n – 1 max-flows: Label: en
Subcubic algorithms for Gomory–Hu tree in unweighted graphs: Label: en
Sparse nonnegative convolution is equivalent to dense nonnegative convolution: Label: en
Tight conditional lower bounds for approximating diameter in directed graphs: Label: en
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH): Label: en
Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors: Label: en
Local concentration inequalities and Tomaszewski’s conjecture: Label: en
Expander random walks: a Fourier-analytic approach: Label: en
Playing unique games on certified small-set expanders: Label: en
Optimal inapproximability of satisfiable k-LIN over non-abelian groups: Label: en
A new coreset framework for clustering: Label: en
Learning Ising models from one or multiple samples: Label: en
Near-optimal learning of tree-structured distributions by Chow-Liu: Label: en
Sample-optimal and efficient learning of tree Ising models: Label: en
When is memorization of irrelevant training data necessary for high-accuracy learning?: Label: en
Statistical query complexity of manifold estimation: Label: en
Robust linear regression: optimal rates in polynomial time: Label: en
Efficiently learning halfspaces with Tsybakov noise: Label: en
Linear bandits with limited adaptivity and learning distributional optimal design: Label: en
Indistinguishability obfuscation from well-founded assumptions: Label: en
The complexity of gradient descent: CLS = PPAD ∩ PLS: Label: en
A (slightly) improved approximation algorithm for metric TSP: Label: en
Separating words and trace reconstruction: Label: en
Discrepancy minimization via a self-balancing walk: Label: en
Statistical physics of random CSPs (tutorial): Label: en
Log-concave polynomials in theory and applications (tutorial): Label: en
Learnability can be independent of set theory (invited paper): Label: en
Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper): Label: en
The metric relaxation for 0 -extension admits an Ω(log ^2/3 k) gap: Label: en
Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs: Label: en