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

1 |
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time |
Arvind, V. et al. |
2022 |

2 |
Monotone Complexity of Spanning Tree Polynomial Re-Visited |
Chattopadhyay, Arkadev et al. |
2022 |

3 |
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product |
Chattopadhyay, Arkadev et al. |
2022 |

4 |
Equivalence Testing of Weighted Automata over Partially Commutative Monoids |
Arvind, V. et al. |
2021 |

5 |
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem |
Arvind, V. et al. |
2020 |

6 |
Efficient Black-Box Identity Testing for Free Group Algebras |
Arvind, V. et al. |
2019 |

7 |
Fast Exact Algorithms Using Hadamard Product of Polynomials |
Arvind, V. et al. |
2019 |

8 |
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials |
Arvind, V. et al. |
2019 |

9 |
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators |
Arvind, V. et al. |
2018 |

10 |
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings |
Arvind, Vikraman et al. |
2017 |

11 |
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach |
Chillara, Suryajith et al. |
2014 |

12 |
Quantum Query Complexity of Multilinear Identity Testing |
Arvind, Vikraman et al. |
2009 |