( 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

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)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)Adversary Lower Bound for the k-sum Problem, and . CoRR, (2012)Adversary lower bounds for the collision and the set equality problems., and . Quantum Inf. Comput., 18 (3&4): 200-224 (2018)Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing., , , and . SODA, page 903-922. SIAM, (2016)Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound.. CCC, page 22-31. IEEE Computer Society, (2014)Span-program-based quantum algorithm for the rank problem. CoRR, (2011)Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection., and . ESA, volume 7501 of Lecture Notes in Computer Science, page 193-204. Springer, (2012)Provably Secure Key Establishment Against Quantum Adversaries., , , , , and . TQC, volume 73 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)