Hamza Fawzi
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A subpolynomial-time algorithm for the free energy of one-dimensional... | ITCS 2023 | 2023-01-10 |
Algorithm computes thermodynamic-limit free energy for translation-invariant 1D quantum chains with error ε in time exp(O(log(1/ε)/log log(1/ε))) — a… | ||
| A Lower Bound on the Positive Semidefinite Rank of Convex Bodies | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Claim: PSD rank m of a convex body is at least on the order of sqrt(log D) where D is the degree of the algebraic boundary of the polar. Proof turns the SDP… | ||
| Extended Formulations 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Quick tutorial that proves the core claims: extended formulations let some polytopes shrink from exponentially many inequalities to n×B network flow LP for… | ||
| Extended Formulations 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows a concrete lower bound for the correlation polytope by extracting a submatrix of its slack matrix with entries 1 for disjoint 0/1 vectors and 0 for pairs… | ||
| Extended Formulations 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Extension complexity equals non-negative rank of the slack matrix, and for the correlation polytope LP/SDP relaxations correspond to families or vector spaces… | ||
| Extended Formulations 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows how any bounded density F on {0,1}^n that tests indistinguishably against a family of functions D1 … Dm is approximated by a normalized exponential of a… | ||
| nothing matches | ||