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

1 |
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees |
Lagarde, Guillaume et al. |
2017 |

2 |
On Polynomial Approximations Over Z/2^kZ* |
Bhrushundi, Abhishek et al. |
2017 |

3 |
Separation of AC^0[oplus] Formulas and Circuits |
Rossman, Benjamin et al. |
2017 |

4 |
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits |
Chen, Ruiwen et al. |
2016 |

5 |
On Polynomial Approximations to AC^0 |
Harsha, Prahladh et al. |
2016 |

6 |
Robust Multiplication-Based Tests for Reed-Muller Codes |
Harsha, Prahladh et al. |
2016 |

7 |
Derandomized Graph Product Results Using the Low Degree Long Code |
Dinur, Irit et al. |
2015 |

8 |
On Improved Degree Lower Bounds for Polynomial Approximation |
Srinivasan, Srikanth |
2013 |

9 |
Certifying polynomials for AC^0(parity) circuits, with applications |
Kopparty, Swastik et al. |
2012 |

10 |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets |
Arvind, Vikraman et al. |
2010 |