Jānis Iraids

MaRDI QIDQ2948452zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Representing polynomial of \textsc{St-Connectivity} Discrete Mathematics and Theoretical Computer Science. DMTCS	2024-09-06	Paper
A note about claw function with a small range (available as arXiv preprint)	2023-06-26	Paper
Quantum bounds for 2D-grid and Dyck language Quantum Information Processing	2023-06-01	Paper
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language (available as arXiv preprint)	2022-07-18	Paper
Quantum speedups for exponential-time dynamic programming algorithms Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper
Polynomials, quantum query complexity, and Grothendieck's inequality (available as arXiv preprint)	2017-10-10	Paper
Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\) SOFSEM 2017: Theory and Practice of Computer Science	2017-04-04	Paper
Exact quantum query complexity of EXACT and THRESHOLD (available as arXiv preprint)	2017-02-01	Paper
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games (available as arXiv preprint)	2017-02-01	Paper
Structured Frequency Algorithms Lecture Notes in Computer Science	2015-09-30	Paper
Integer complexity: experimental and analytical results. II Descriptional Complexity of Formal Systems	2015-08-07	Paper
Integer Complexity: Experimental and Analytical Results	2012-03-29	Paper

Research outcomes over time

This page was built for person: Jānis Iraids