Leslie Ann Goldberg
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 6 in the filters
on a stage with
- Kitty Meeksonce
- Marc Rothonce
- Marco Bressanonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Counting Subgraphs in Somewhere Dense Graphs | ITCS 2023 | 2023-01-10 |
Classifies parameterized complexity of counting homomorphisms, (induced) subgraphs when both pattern and host classes are structured: FPT occurs exactly when… | ||
| Counting Solutions to Random CNF Formulas | Computational Phase Transitions (Simons Institute, 2020) | 2020-09-21 |
Gives a polynomial-time algorithm that approximates the number of satisfying assignments Z for random k-CNF when k is large and clause density alpha ≤ 2^{r k}… | ||
| Approximating the Matching Polynomial | Deterministic Counting, Probability, and Zeros of Partition Functions (Simons Institute workshop, 2019) | 2019-03-18 |
Gives a deterministic algorithmic boundary: positive real weights admit the classical Markov-chain FPRAS, bounded-degree graphs admit a deterministic… | ||
| Approximately Counting Graph Homomorphisms | The Classification Program of Counting Complexity | 2016-03-28 |
Fixing any nontrivial template H, approximately counting H‑colorings is never easier than approximately counting independent sets in bipartite graphs: the… | ||
| The Complexity of Approximately Counting in 2-spin Systems on k-uniform Bounded-degree Hypergraphs | Approximate Counting, Markov Chains and Phase Transitions | 2016-02-22 |
Classifies complexity for symmetric Boolean k-ary constraints on k‑uniform bounded‑degree hypergraphs: any nontrivial function has a degree Delta beyond which… | ||
| Approximate Counting I | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Survey claims three coarse approximation classes: problems with an FPRAS, NP‑hard ones (SAT‑level), and an intermediate class centered on BIS (counting… | ||
| nothing matches | ||