( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.

, , , , и . CCC, том 79 из LIPIcs, стр. 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.

Aleksandrs Ecins

 

Другие публикации лиц с тем же именем

Size of Quantum Versus Deterministic Finite Automata., , , , , , , , , и . VLSI, стр. 303-308. CSREA Press, (2003)A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases., и . MMICS, том 5393 из Lecture Notes in Computer Science, стр. 50-69. Springer, (2008)On the Power of Non-adaptive Learning Graphs., и . CCC, стр. 44-55. IEEE Computer Society, (2013)Quantum Dual Adversary for Hidden Subgroups and Beyond.. UCNC, том 11493 из Lecture Notes in Computer Science, стр. 30-36. Springer, (2019)Quantum Algorithms for Classical Probability Distributions.. ESA, том 144 из LIPIcs, стр. 16:1-16:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Multi-letter Reversible and Quantum Finite Automata., , и . Developments in Language Theory, том 4588 из Lecture Notes in Computer Science, стр. 60-71. Springer, (2007)Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems., и . TQC, том 111 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Adversary lower bound for the k-sum problem., и . ITCS, стр. 323-328. ACM, (2013)A polynomial lower bound for testing monotonicity., и . STOC, стр. 1021-1032. ACM, (2016)Span programs for functions with constant-sized 1-certificates: extended abstract.. STOC, стр. 77-84. ACM, (2012)