No. |
Title |
Author |
Year |
---|

1 |
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts |
Chillara, Suryajith et al. |
2023 |

2 |
Lower Bounds on Stabilizer Rank |
Peleg, Shir et al. |
2022 |

3 |
Robust Sylvester-Gallai Type Theorem for Quadratic Polynomials |
Peleg, Shir et al. |
2022 |

4 |
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits |
Medini, Dori et al. |
2021 |

5 |
A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials |
Peleg, Shir et al. |
2020 |

6 |
On Some Recent Advances in Algebraic Complexity (Invited Talk) |
Shpilka, Amir |
2020 |

7 |
Front Matter, Table of Contents, Preface, Conference Organization |
Shpilka, Amir |
2019 |

8 |
LIPIcs, Volume 137, CCC'19, Complete Volume |
Shpilka, Amir |
2019 |

9 |
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs |
Anderson, Matthew et al. |
2016 |

10 |
Proof Complexity Lower Bounds from Algebraic Circuit Complexity |
Forbes, Michael A. et al. |
2016 |

11 |
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas |
Oliveira, Rafael et al. |
2015 |