| Workshop on Algebraic Complexity Theory |
| |
| Wednesday |
| 10.15--11.00 | Ketan Mulmuley |
On P vs NP, Geometric Complexity theory, and the Flip (I) |
| 11.15--12.00 | Ketan Mulmuley |
On P vs NP, Geometric Complexity theory, and the Flip (I)
|
| [lunch] |
| 13.15--14.15 | Raghavendra Rao |
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae |
| 14.30--15.00 | Maurice Jansen |
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs |
| [break] | |
Note: Manindra Agrawal speaks outside of this workshop on "PRIMES is in P" at the Mathematics Department at 16.15
(See here). |
|
|
|
|
| Thursday |
| 10.00--10.45 | Ketan Mulmuley | On P vs NP, Geometric Complexity theory, and the Flip (II) |
| 11.00--11.45 | Ketan Mulmuley | On P vs NP, Geometric Complexity theory, and the Flip (II) |
| [lunch] |
| 13.15--14.15 | Pascal Koiran |
On the expressive power of planar perfect matching and permanents
of bounded treewidth matrices |
| 14.30--15.30 | Manindra Agrawal |
Arithmetical Circuits: A Chasm at Depth Four |
| [break] |
| 16.15--17.15 | Nicolas Ressayre | A Quadratic Bound for the Determinant and Permanent Problem |
| 17.30--18.30 | Jayalal Sarma |
Matrix Rigidity : Computation and (Algebraically) Explicit
Constructions |
|
|
|
|
| Friday |
| 10.00--10.45 | Ketan Mulmuley | On P vs NP, Geometric Complexity theory, and the Flip (III) |
| 11.00--11.45 | Ketan Mulmuley | On P vs NP, Geometric Complexity theory, and the Flip (III) |
| [lunch] |
| 12.55--13.55 | Pascal Koiran |
Decision versus evaluation in algebraic complexity theory |
| [break] |
| 15.05--16.05 | Manindra Agrawal |
A Possible Pseudorandom Generator Against Arithmetic Circuits |
|
|
|
|
|
|
| Location of all talks: Turing 014, Computer Science Department, IT-Parken, Aabogade 34. |
|
