( en | de | ru )

 

Disambiguation of "Sinhababu, Amit"

Author of the publication

copydeleteadd this publication to your clipboard
Factorization of Polynomials Given By Arithmetic Branching Programs.

, and . CCC, volume 169 of LIPIcs, page 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Regina Amith-Borchart

Menachem Amitai

Samuel Amiteye

Menachem Amitai

Amit Singh

 

Other publications of authors with the same name

Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits., , and . MFCS, volume 58 of LIPIcs, page 74:1-74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Factorization of Polynomials Given By Arithmetic Branching Programs., and . CCC, volume 169 of LIPIcs, page 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field., , and . Theory Comput., (2019)Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring., , and . J. ACM, 69 (3): 18:1-18:39 (2022)Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits., , and . Comput. Complex., 27 (4): 617-670 (2018)Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity., , and . CCC, volume 102 of LIPIcs, page 10:1-10:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Discovering the roots: Uniform closure results for algebraic classes under factoring., , and . Electron. Colloquium Comput. Complex., (2017)Factorization of Polynomials Given by Arithmetic Branching Programs., and . Comput. Complex., 30 (2): 15 (2021)Discovering the roots: uniform closure results for algebraic classes under factoring., , and . STOC, page 1152-1165. ACM, (2018)Arithmetic Circuit Complexity of Division and Truncation., , , and . CCC, volume 200 of LIPIcs, page 25:1-25:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)