Author of the publication

Testing Polynomial Equivalence by Scaling Matrices.

, , and . FCT, volume 10472 of Lecture Notes in Computer Science, page 111-122. Springer, (2017)

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.

 

Other publications of authors with the same name

Lower Bounds for Special Cases of Syntactic Multilinear ABPs., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 701-712. Springer, (2018)On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models., and . Fundam. Informaticae, 177 (1): 69-93 (2020)Faster algorithms for finding and counting subgraphs., , , , and . J. Comput. Syst. Sci., 78 (3): 698-706 (2012)Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials., , and . Electron. Colloquium Comput. Complex., (2016)Sum of Products of Read-Once Formulas., and . FSTTCS, volume 65 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 655-667. Springer, (2012)On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction., , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 250-261. Springer, (2017)Parameterized Analogues of Probabilistic Computation., and . CoRR, (2014)On hard instances of non-commutative permanent., and . Discret. Appl. Math., (2020)Parameterised Counting in Logspace., , , and . Algorithmica, 85 (10): 2923-2961 (October 2023)