Amit Sinhababu

According to our database1, Amit Sinhababu authored at least 10 papers between 2016 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Maximum Matching and Related Problems in Catalytic Logspace.
Electron. Colloquium Comput. Complex., 2026

2025
IPS Lower Bounds for Formulas and Sum of1 ROABPs.
Electron. Colloquium Comput. Complex., 2025

IPS Lower Bounds for Formulas and Sum of ROABPs.
Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

2024
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors.
Proceedings of the Approximation, 2024

2021
Arithmetic Circuit Complexity of Division and Truncation.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Factorization of Polynomials Given By Arithmetic Branching Programs.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field.
Theory Comput., 2019

2018
Discovering the roots: uniform closure results for algebraic classes under factoring.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity.
Proceedings of the 33rd Computational Complexity Conference, 2018

2016
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016


  Loading...