Items where Author is "Sinhababu, Amit"

Article

Guo, Zeyu ; Saxena, Nitin ; Sinhababu, Amit (2019) Algebraic Dependencies And Pspace Algorithms In Approximative Complexity Over Any Field Theory of Computing, 15 (1). pp. 1-30. ISSN 1557-2862

Pandey, Anurag ; Saxena, Nitin ; Sinhababu, Amit (2018) Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits Computational Complexity, 27 (4). pp. 617-670. ISSN 1016-3328

Conference or Workshop Item

Guo, Zeyu ; Saxena, Nitin ; Sinhababu, Amit (2018) Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity In: 33rd Computational Complexity Conference (CCC 2018), Dagstuhl, Germany.

Dutta, Pranjal ; Saxena, Nitin ; Sinhababu, Amit (2018) Discovering the roots: uniform closure results for algebraic classes under factoring In: STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, June 2018.

Pandey, Anurag ; Saxena, Nitin ; Sinhababu, Amit (2016) Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Dagstuhl, Germany.