algebra:start
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
algebra:start [2018/11/09 23:11] Algebraic and Geometric Complexity [Algebraic and Geometric Complexity Theory Reading/Discussion Group] |
algebra:start [2018/12/12 04:44] Algebraic and Geometric Complexity |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| - | Next meeting: Tuesday, November 13, **4:00 pm** (not 4:10pm) in room 116 (the room is reserved for us). Vishwas Bhargav will talk about Deterministic Factorization of Sparse Polynomials of Bounded Individual Degree. | + | |
| + | ===== Past talks ===== | ||
| + | |||
| + | * 2018-12-11: Amir Yehudayoff, Proof complexity | ||
| + | * 2018-11-27: Nutan Limaye, Waring rank of monomials | ||
| + | * 2018-11-13: Vishwas Bhargava, Deterministic Factorization of Sparse Polynomials of Bounded Individual Degree | ||
| + | * 2018-10-23: Christian Ikenmeyer, Young flattenings | ||
| + | * 2018-10-09: Eric Allender, Dual VP classes | ||
| + | * 2018-10-02: Christian Ikenmeyer, No occurrence obstructions in geometric complexity theory | ||
| + | * 2018-09-25: Mrinal Kumar, Generalized matrix completion and algebraic natural proofs | ||
| + | * 2018-09-18: Rafael Oliveira, Barriers for Rank Methods in Arithmetic Complexity [[https://arxiv.org/abs/1710.09502]]. | ||
| + | * 2018-09-07: Mrinal Kumar, On top fan-in vs formal degree for depth-3 arithmetic circuits | ||
| + | * 2018-09-04: Christian Ikenmeyer, Introduction to the representation theory of the general linear group | ||
| + | |||
| ===== Papers ===== | ===== Papers ===== | ||
| + | * Bhargava, Saraf, Volkovich, 2018, Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree [[https://arxiv.org/abs/1808.06655|link]] | ||
| * Allender, Gal, Mertz, 2014, Dual VP classes [[https://eccc.weizmann.ac.il/report/2014/122/|link]] | * Allender, Gal, Mertz, 2014, Dual VP classes [[https://eccc.weizmann.ac.il/report/2014/122/|link]] | ||
| * Bürgisser, Ikenmeyer, Panova, 2016, No occurrence obstructions in geometric complexity theory [[https://arxiv.org/abs/1604.06431|link]] | * Bürgisser, Ikenmeyer, Panova, 2016, No occurrence obstructions in geometric complexity theory [[https://arxiv.org/abs/1604.06431|link]] | ||
| Line 20: | Line 35: | ||
| * GCT lecture notes [[http://people.mpi-inf.mpg.de/~cikenmey/teaching/summer17/introtogct/gct.pdf|link]] | * GCT lecture notes [[http://people.mpi-inf.mpg.de/~cikenmey/teaching/summer17/introtogct/gct.pdf|link]] | ||
| - | |||
| - | ===== Past talks ===== | ||
| - | |||
| - | * 2018-10-23: Christian Ikenmeyer, Young flattenings | ||
| - | * 2018-10-09: Eric Allender, Dual VP classes | ||
| - | * 2018-10-02: Christian Ikenmeyer, No occurrence obstructions in geometric complexity theory | ||
| - | * 2018-09-25: Mrinal Kumar, Generalized matrix completion and algebraic natural proofs | ||
| - | * 2018-09-18: Rafael Oliveira, Barriers for Rank Methods in Arithmetic Complexity [[https://arxiv.org/abs/1710.09502]]. | ||
| - | * 2018-09-07: Mrinal Kumar, On top fan-in vs formal degree for depth-3 arithmetic circuits | ||
| - | * 2018-09-04: Christian Ikenmeyer, Introduction to the representation theory of the general linear group | ||
| ===== MathJax ===== | ===== MathJax ===== | ||
algebra/start.txt · Last modified: 2018/12/12 04:44 by Algebraic and Geometric Complexity