( en | de | ru )

 

Disambiguation of "Santha, Miklos"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Benedikt Miklos

Miklos Scholl

Miklos Prodan

Miklós Verbowszky

Miklós Halmágyi

 

Other publications of authors with the same name

Semantical Counting Circuits., and . Theory Comput. Syst., 36 (3): 217-229 (2003)Relativized Arthur-Merlin versus Merlin-Arthur Games.. FSTTCS, volume 287 of Lecture Notes in Computer Science, page 435-442. Springer, (1987)Semantical Counting Circuits., and . CIAC, volume 1767 of Lecture Notes in Computer Science, page 87-101. Springer, (2000)Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes., , , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 380-391. Springer, (2006)A New Public-Key Cryptosystem via Mersenne Numbers., , , and . CRYPTO (3), volume 10993 of Lecture Notes in Computer Science, page 459-482. Springer, (2018)Quantum Testers for Hidden Group Properties., , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 419-428. Springer, (2003)Efficient testing of groups., , and . STOC, page 157-166. ACM, (2005)Linear-Time Algorithm for Quantum 2SAT., , , and . Theory Comput., 14 (1): 1-27 (2018)On the Power of a Unique Quantum Witness., , , , , and . Theory Comput., 8 (1): 375-400 (2012)On the cut dimension of a graph., , , and . CoRR, (2020)