From post

Factorization of Polynomials Given By Arithmetic Branching Programs.

, и . CCC, том 169 из LIPIcs, стр. 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.

 

Другие публикации лиц с тем же именем

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