Noah Fleming
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2022–2023
on a stage with
all 6 in the filters
who talks about the same things
- Russell Impagliazzo12 talks
- Toniann Pitassi5 talks
- Robert Robere5 talks
- Lijie Chen9 talks
- Yuval Filmus9 talks
- Théo Winterhalter14 talks
| title | conference | date |
|---|---|---|
| The Proof Complexity of Integer Programming | Satisfiability: Theory, Practice, and Beyond 2023 | 2023-04-17 |
Introduces Stabbing Planes as a proof system modeling branch-and-cut and proves a constructive translation that, when each query has bounded-coefficient… | ||
| TFNP | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Claims that relate TFNP subclasses to concrete models: resolution = PLS via an explicit reduction from search(F) to the sink-of-DAG problem (one DAG vertex per… | ||
| TFNP Characterizations of Proof Systems and Monotone Circuits | ITCS 2023 | 2023-01-10 |
Paper proves necessary and sufficient conditions for when TFNP classes correspond to proof systems and to monotone-circuit models, and constructs a formal… | ||
| Extremely Deep Proofs | ITCS 2022 | 2022-01-31 |
Proves that for resolution, k‑DNF resolution and cutting planes there are CNFs on n variables with polynomial‑size proofs but any subexponential‑size proof… | ||
| On Semi-Algebraic Proofs and Algorithms | ITCS 2022 | 2022-01-31 |
Shows that minimizing conical junta degree on the violations polynomial exactly matches Sherali‑Adams degree via a Hrubeš‑style factorization, uses slack… | ||
| nothing matches | ||