Author of the publication

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.

, , , , and . CCC, volume 79 of LIPIcs, page 30:1-30:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups., , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 759-771. Springer, (2008)Quantum and classical algorithms for approximate submodular function minimization., , , and . Quantum Inf. Comput., 19 (15&16): 1325-1349 (2019)On the quantum time complexity of divide and conquer., , , , and . CoRR, (2023)Total functions in QMA., and . Quantum Inf. Process., 20 (1): 35 (2021)Quantum algorithms for graph problems with cut queries., , and . SODA, page 939-958. SIAM, (2021)Query Complexity of Matroids., and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 300-311. Springer, (2013)Verifying the Determinant in Parallel., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 65-73. Springer, (1994)On Solving Systems of Diagonal Polynomial Equations Over Finite Fields., and . FAW, volume 9130 of Lecture Notes in Computer Science, page 125-137. Springer, (2015)Approximate Nash Equilibria for Multi-player Games., , and . SAGT, volume 4997 of Lecture Notes in Computer Science, page 267-278. Springer, (2008)On the Reversibility of Oblivious Transfer., and . EUROCRYPT, volume 547 of Lecture Notes in Computer Science, page 106-113. Springer, (1991)