SOFSEM 2004: Theory and Practice of Computer Science
From MaRDI portal
Publication:5902000
DOI10.1007/b95046zbMath1202.68183MaRDI QIDQ5902000
Aija Bērziņa, Oksana Scegulnaja, Lelde Lāce, Andrej Dubrovsky, Rūsiņš Freivalds
Publication date: 4 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95046
Related Items
On the power of Ambainis lower bounds, A query-efficient quantum algorithm for maximum matching on general graphs, Quantum algorithms for matching problems, The quantum query complexity of the determinant, Evolutionary algorithms for quantum computers