Zero-one laws for random feasibility problems
From MaRDI portal
Cites work
- A Fourier-analytic approach for the discrepancy of random set systems
- A friendly smoothed analysis of the simplex method
- A new framework for matrix discrepancy: partial coloring bounds via mirror descent
- A unified approach to discrepancy minimization
- Algorithms and barriers in the symmetric binary perceptron model
- Balancing vectors in any norm
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- Boolean functions: influence, threshold and noise
- Colorful vector balancing
- Critical window of the symmetric perceptron
- Distances to lattice points in knapsack polyhedra
- Distribution of the threshold for the symmetric perceptron
- Envelope Theorems for Arbitrary Choice Sets
- Every monotone graph property has a sharp threshold
- Four deviations suffice for rank 1 matrices
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Geometric discrepancy. An illustrated guide
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- scientific article; zbMATH DE number 734955 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 7829245 (Why is no real title available?)
- Integer feasibility of random polytopes: random integer programs
- Integrality gaps for random integer programs via discrepancy
- Linear Size Sparsifier and the Geometry of the Operator Norm Ball
- Matrix discrepancy from Quantum communication
- Mean Field Models for Spin Glasses
- Mean field models for spin glasses. Volume I: Basic examples.
- On perfectly friendly bisections of random graphs
- On the Beck-Fiala conjecture for random set systems
- On the discrepancy of random low degree set systems
- On the discrepancy of random matrices with many columns
- On the integrality gap of binary integer programs with Gaussian data
- Probabilistic Analysis of the Multidimensional Knapsack Problem
- Proof of the contiguity conjecture and lognormal limit for the symmetric perceptron
- Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
- Rigorous solution of the Gardner problem
- Self averaging and the space of interactions in neural networks
- Sensitivity theorems in integer linear programming
- Sharp threshold for the Ising perceptron model
- Sharp threshold sequence and universality for Ising perceptron models
- Sharp thresholds of graph properties, and the k-sat problem
- Smoothed analysis of algorithms
- Smoothed analysis of the Komlós conjecture
- Smoothed analysis of the Komlós conjecture: Rademacher noise
- Solving the closest vector problem in 2ⁿ time -- the discrete Gaussian strikes again!
- Storage capacity in symmetric binary perceptrons
- Superconcentration and related topics
- The discrepancy of random rectangular matrices
- Twice-Ramanujan sparsifiers
- Upper and lower bounds for matrix discrepancy
This page was built for publication: Zero-one laws for random feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927562)
