Suguru Tamaki
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 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Faster Satisfiability Algorithms for Systems of Polynomial Equations over Finite Fields and ACC^0[p] | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Randomized algorithm solves SysPol_q on degree-k instances in time q^{n (1 - 1/O(q^k))}, giving 0.868765^n for GF(2), and for prime q the counting version… | ||
| Satisfiability Algorithms for Small Depth Circuits with Symmetric Gates | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Deterministic algorithm counts satisfying assignments for AC0 circuits that have a subpolynomial number t(n) of weighted symmetric gates with maximum gate… | ||
| nothing matches | ||