( en | de | ru )

 

Disambiguation of "Belovs, Aleksandrs"

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.

Aleksandrs Ecins

 

Other publications of authors with the same name

A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases., and . MMICS, volume 5393 of Lecture Notes in Computer Science, page 50-69. Springer, (2008)Size of Quantum Versus Deterministic Finite Automata., , , , , , , , , and . VLSI, page 303-308. CSREA Press, (2003)On the Power of Non-adaptive Learning Graphs., and . CCC, page 44-55. IEEE Computer Society, (2013)On the Power of Non-Adaptive Learning Graphs. CoRR, (2012)Adversary lower bound for the k-sum problem., and . ITCS, page 323-328. ACM, (2013)A polynomial lower bound for testing monotonicity., and . STOC, page 1021-1032. ACM, (2016)Span programs for functions with constant-sized 1-certificates: extended abstract.. STOC, page 77-84. ACM, (2012)Non-intersecting Complexity.. SOFSEM, volume 3831 of Lecture Notes in Computer Science, page 158-165. Springer, (2006)Quantum Dual Adversary for Hidden Subgroups and Beyond.. UCNC, volume 11493 of Lecture Notes in Computer Science, page 30-36. Springer, (2019)Multi-letter Reversible and Quantum Finite Automata., , and . Developments in Language Theory, volume 4588 of Lecture Notes in Computer Science, page 60-71. Springer, (2007)