algebra:start

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||

algebra:start [2018/11/02 06:38] Algebraic and Geometric Complexity [Past talks] |
algebra:start [2018/12/12 04:43] Algebraic and Geometric Complexity [Past talks] |
||
---|---|---|---|

Line 3: | Line 3: | ||

- | Next meeting: Tuesday, November 6, **4:00 pm** (not 4:10pm) in room 116 (the room is reserved for us). Yuval Filmus will talk about "How to multiply matrices fast". | + | Next meeting: Tuesday, December 11, **4:00 pm** (not 4:10pm) in room 116 (the room is reserved for us). Amir Yehudayoff will talk about his research. |

===== 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 24: | Line 24: | ||

===== Past talks ===== | ===== 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-23: Christian Ikenmeyer, Young flattenings | ||

* 2018-10-09: Eric Allender, Dual VP classes | * 2018-10-09: Eric Allender, Dual VP classes |

algebra/start.txt · Last modified: 2018/12/12 04:44 by Algebraic and Geometric Complexity