Amit Sinhababu

21 papers A* 1A 4B 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2025 — conf
IPS Lower Bounds for Formulas and Sum of ROABPs.
FSTTCS
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2025 J jnl
IPS Lower Bounds for Formulas and Sum of ROABPs.
CoRR
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2025 J jnl
IPS Lower Bounds for Formulas and Sum of1 ROABPs.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2024 A conf
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors.
APPROX/RANDOM
Pranjal Dutta, Amit Sinhababu, Thomas Thierauf
2024 J jnl
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors.
CoRR
Pranjal Dutta, Amit Sinhababu, Thomas Thierauf
2024 J jnl
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors.
Electron. Colloquium Comput. Complex.
Pranjal Dutta, Amit Sinhababu, Thomas Thierauf
2022 J jnl
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring.
J. ACM
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2021 A conf
Arithmetic Circuit Complexity of Division and Truncation.
CCC
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
2021 J jnl
Arithmetic Circuit Complexity of Division and Truncation.
Electron. Colloquium Comput. Complex.
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
2021 J jnl
Factorization of Polynomials Given by Arithmetic Branching Programs.
Comput. Complex.
Amit Sinhababu, Thomas Thierauf
2020 A conf
Factorization of Polynomials Given By Arithmetic Branching Programs.
CCC
Amit Sinhababu, Thomas Thierauf
2020 J jnl
Factorization of Polynomials Given by Arithmetic Branching Programs.
Electron. Colloquium Comput. Complex.
Amit Sinhababu, Thomas Thierauf
2019 J jnl
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field.
Theory Comput.
Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018 A conf
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity.
CCC
Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018 J jnl
Algebraic dependencies and PSPACE algorithms in approximative complexity.
CoRR
Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018 J jnl
Algebraic dependencies and PSPACE algorithms in approximative complexity.
Electron. Colloquium Comput. Complex.
Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018 J jnl
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits.
Comput. Complex.
Anurag Pandey, Nitin Saxena, Amit Sinhababu
2018 A* conf
Discovering the roots: uniform closure results for algebraic classes under factoring.
STOC
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2017 J jnl
Discovering the roots: Uniform closure results for algebraic classes under factoring.
CoRR
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2017 J jnl
Discovering the roots: Uniform closure results for algebraic classes under factoring.
Electron. Colloquium Comput. Complex.
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2016 B conf
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits.
MFCS
Anurag Pandey, Nitin Saxena, Amit Sinhababu