Robert Robere
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
- Noah Fleming2×
- Assaf Schusteronce
- Gal Yehudaonce
all 7 in the filters
who talks about the same things
- Noah Fleming6 talks
- Toniann Pitassi5 talks
- Yuval Filmus9 talks
- Alon Rosen2 talks
- Ronen Shaltiel2 talks
- Ran Raz6 talks
| title | conference | date |
|---|---|---|
| A Survey of Automatability | Satisfiability: Theory, Practice, and Beyond 2023 | 2023-04-17 |
Defines automatability as finding a proof within time bounded by the shortest proof length and contrasts algorithms and lower bounds. Gives the trivial 2^s… | ||
| Pseudorandom Self-Reductions for NP-Complete Problems | ITCS 2022 | 2022-01-31 |
Claim: non-adaptive pseudorandom self-reduction for Max Clique (and every nontrivial hereditary max-subgraph problem) holds assuming the non-uniform planted… | ||
| 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… | ||
| Lifting Nullstellensatz Degree to Monotone Span Program Size | Boolean Devices 2018 | 2018-09-10 |
States a concrete equivalence: for any unsatisfiable CNF the Nullstellensatz degree of refutation lifts (via a constant-size gadget) to the monotone span… | ||
| nothing matches | ||