Amit Sinhababu

Publication Activity (10 Years)

Years Active: 2016-2022
Publications (10 Years): 15

Top Topics

Complexity Bounds

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Comput. Complex.

Publications

Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. J. ACM 69 (3) (2022)
Amit Sinhababu, Thomas Thierauf
Factorization of Polynomials Given by Arithmetic Branching Programs. Comput. Complex. 30 (2) (2021)
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
Arithmetic Circuit Complexity of Division and Truncation. Computational Complexity Conference (2021)
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. 28 (2021)
Amit Sinhababu, Thomas Thierauf
Factorization of Polynomials Given by Arithmetic Branching Programs. Electron. Colloquium Comput. Complex. 27 (2020)
Amit Sinhababu, Thomas Thierauf
Factorization of Polynomials Given By Arithmetic Branching Programs. Computational Complexity Conference (2020)
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. Theory Comput. 15 (2019)
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Discovering the roots: uniform closure results for algebraic classes under factoring. STOC (2018)
Anurag Pandey, Nitin Saxena, Amit Sinhababu
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. 27 (4) (2018)
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Algebraic dependencies and PSPACE algorithms in approximative complexity. Electron. Colloquium Comput. Complex. 25 (2018)
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. Computational Complexity Conference (2018)
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Algebraic dependencies and PSPACE algorithms in approximative complexity. CoRR (2018)
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Discovering the roots: Uniform closure results for algebraic classes under factoring. Electron. Colloquium Comput. Complex. 24 (2017)
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Discovering the roots: Uniform closure results for algebraic classes under factoring. CoRR (2017)
Anurag Pandey, Nitin Saxena, Amit Sinhababu
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. MFCS (2016)