( en | de | ru )

 

Disambiguation of "Prusis, Krisjanis"

Author of the publication

copydeleteadd this publication to your clipboard
All Classical Adversary Methods Are Equivalent for Total Functions.

, , , , and . ACM Trans. Comput. Theory, 13 (1): 7:1-7:20 (2021)

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.

No persons found for author name Prusis, Krisjanis
add a person with the name Prusis, Krisjanis
 

Other publications of authors with the same name

Doubling the Success of Quantum Walk Search Using Internal-State Measurements, , and . J. Phys. A: Math. Theor. 49, 455301, (2016)Exact Affine Counter Automata., , , , and . Int. J. Found. Comput. Sci., 33 (3&4): 349-370 (2022)Quantum Lower Bounds for 2D-Grid and Dyck Language., , , , and . CoRR, (2019)All Classical Adversary Methods are Equivalent for Total Functions., , , and . STACS, volume 96 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)All Classical Adversary Methods Are Equivalent for Total Functions., , , , and . ACM Trans. Comput. Theory, 13 (1): 7:1-7:20 (2021)Quantum bounds for 2D-grid and Dyck language., , , , , , , , and . Quantum Inf. Process., 22 (5): 194 (May 2023)Sensitivity versus Certificate Complexity of Boolean Functions., , and . CoRR, (2015)A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity., and . Electron. Colloquium Comput. Complex., (2014)Quantum Speedups for Exponential-Time Dynamic Programming Algorithms., , , , , and . CoRR, (2018)All Classical Adversary Methods are Equivalent for Total Functions., , , and . Electron. Colloquium Comput. Complex., (2017)