Meena Mahajan
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Beyond SAT - Proofs for QBF, and more | Satisfiability: Theory, Practice, and Beyond 2023 | 2023-04-17 |
Overview of what is known and what still fails: four concrete QBF proof paradigms — expansion, universal reduction — plus literal merging/long‑distance… | ||
| Locating Linear Decision Lists within TC^0 | Boolean Devices 2018 | 2018-09-10 |
Meena Mahajan (Institute of Mathematical Sciences)
https://simons.berkeley.edu/talks/tbd-18
Boolean Devices | ||
| Enumerator Polynomials: Completeness and Intermediate Complexity | The Classification Program of Counting Complexity | 2016-03-28 |
Defines “enumerator” polynomials that sum monomials encoding combinatorial objects, gives five concrete families (cliques, Hamilton cycles, perfect matchings… | ||
| nothing matches | ||