Christian Ikenmeyer
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
- Balagopal Komarathonce
- Nitin Saurabhonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Karchmer-Wigderson Games for Hazard-free Computation | ITCS 2023 | 2023-01-10 |
Defines a hazard-free Karchmer-Wigderson game and proves its communication cost exactly matches hazard-free formula depth and its protocol size matches formula… | ||
| Geometric Complexity Theory and Tensor Rank | Geometric Complexity Theory 2014 | 2014-09-15 |
Generalizes Strassen’s degree-4 vanishing equations to degree 3k+1 polynomials that vanish on tensors of border rank ≤ 3k, producing a nontrivial lower bound… | ||
| Writing Down Polynomials via Representation Theory I | Algorithms and Complexity in Algebraic Geometry Boot Camp 2014 | 2014-09-02 |
Christian Ikenmeyer, Texas A&M University
Algebraic Geometry Boot Camp
http://simons.berkeley.edu/talks/christian-ikenmeyer-2014-09-02 | ||
| Writing Down Polynomials via Representation Theory II | Algorithms and Complexity in Algebraic Geometry Boot Camp 2014 | 2014-09-02 |
Constructs explicit highest-weight tensors for Sym^d(Sym^n(C^{n^2})^) and writes polynomials as symmetric tensor contraction so evaluation becomes a sum of… | ||
| nothing matches | ||