Juris Smotrovs
Juris Smotrovs
profesors, Latvijas Universitāte
Verified email at - Homepage
Cited by
Cited by
Separations in query complexity based on pointer functions
A Ambainis, K Balodis, A Belovs, T Lee, M Santha, J Smotrovs
Journal of the ACM (JACM) 64 (5), 1-24, 2017
Multi-letter reversible and quantum finite automata
A Belovs, A Rosmanis, J Smotrovs
Developments in Language Theory: 11th International Conference, DLT 2007 …, 2007
Polynomials, quantum query complexity, and Grothendieck's inequality
S Aaronson, A Ambainis, J Iraids, M Kokainis, J Smotrovs
arXiv preprint arXiv:1511.08682, 2015
Exact quantum query complexity of EXACT and THRESHOLD
A Ambainis, J Iraids, J Smotrovs
arXiv preprint arXiv:1302.1235, 2013
Quantum lower and upper bounds for 2D-grid and Dyck language
A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ...
arXiv preprint arXiv:2007.03402, 2020
A criterion for attaining the Welch bounds with applications for mutually unbiased bases
A Belovs, J Smotrovs
Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth, 50-69, 2008
Unions of identifiable classes of total recursive functions
K Apsītis, R Freivalds, M Krikis, R Simanovskis, J Smotrovs
Analogical and Inductive Inference: International Workshop AII'92 Dagstuhl …, 1992
Quantum strategies are better than classical in almost any XOR game
A Ambainis, A Bačkurs, K Balodis, D Kravčenko, R Ozols, J Smotrovs, ...
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
Optimal quantum query bounds for almost all Boolean functions
A Ambainis, A Backurs, J Smotrovs, R de Wolf
arXiv preprint arXiv:1208.1122, 2012
Effects of Kolmogorov complexity present in inductive inference as well
A Ambainis, K Apsītis, C Calude, R Freivalds, M Karpinski, T Larfeldt, ...
Algorithmic Learning Theory: 8th International Workshop, ALT'97 Sendai …, 1997
Parameterized quantum query complexity of graph collision
A Ambainis, K Balodis, J Iraids, R Ozols, J Smotrovs
arXiv preprint arXiv:1305.1021, 2013
Closedness properties in ex-identification
K Apsıtis, R Freivalds, R Simanovskis, J Smotrovs
Theoretical computer science 268 (2), 367-393, 2001
Unions of identifiable families of languages
K Apsītis, R Freivalds, R Simanovskis, J Smotrovs
Grammatical Interference: Learning Syntax from Sentences: Third …, 1996
Enumerable classes of total recursive functions: Complexity of inductive inference
A Ambainis, J Smotrovs
International Workshop on Analogical and Inductive Inference, 10-25, 1994
8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
H Shah, G Kuperberg, J Klassen, J Chen, B Zeng, AM Childs, R Kothari, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2013
Worst case analysis of non-local games
A Ambainis, A Bačkurs, K Balodis, A Škuškovniks, J Smotrovs, M Virza
SOFSEM 2013: Theory and Practice of Computer Science: 39th International …, 2013
Closedness properties in team learning of recursive functions
J Smotrovs
European Conference on Computational Learning Theory, 79-93, 1997
Quantum bounds for 2D-grid and Dyck language
A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ...
Quantum Information Processing 22 (5), 194, 2023
Representing polynomial of ST-CONNECTIVITY
J Iraids, J Smotrovs
Discrete Mathematics & Theoretical Computer Science 25 (Combinatorics), 2024
Quantum Lower Bounds for 2D-Grid and Dyck Language
A Ambainis, K Balodis, J Iraids, K Prūsis, J Smotrovs
arXiv preprint arXiv:1911.12638, 2019
The system can't perform the operation now. Try again later.
Articles 1–20