Author of the publication

On the Power of Parity Polynomial Time.

, and . STACS, volume 349 of Lecture Notes in Computer Science, page 229-239. Springer, (1989)

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

Clifford gates in the Holant framework., , and . Theor. Comput. Sci., (2018)Holographic Algorithms Beyond Matchgates., , and . CoRR, (2013)Clifford Gates in the Holant Framework., , and . CoRR, (2017)A note on quadratic residuosity and UP., and . Inf. Process. Lett., 92 (3): 127-131 (2004)Gadgets and anti-gadgets leading to a complexity dichotomy., , and . ITCS, page 452-467. ACM, (2012)A complete dichotomy rises from the capture of vanishing signatures: extended abstract., , and . STOC, page 635-644. ACM, (2013)The Complexity of Some Lattice Problems.. ANTS, volume 1838 of Lecture Notes in Computer Science, page 1-32. Springer, (2000)On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results., and . COCOON, volume 2697 of Lecture Notes in Computer Science, page 202-211. Springer, (2003)Valiant's Holant Theorem and Matchgate Tensors., and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 248-261. Springer, (2006)Fine Separation of Average Time Complexity Classes., and . STACS, volume 1046 of Lecture Notes in Computer Science, page 331-343. Springer, (1996)