SOFSEM 2004: Theory and Practice of Computer Science
From MaRDI portal
Publication:5902000
DOI10.1007/b95046zbMath1202.68183OpenAlexW2916538296MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A query-efficient quantum algorithm for maximum matching on general graphs ⋮ Quantum algorithms for matching problems ⋮ Evolutionary algorithms for quantum computers ⋮ The quantum query complexity of the determinant ⋮ On the power of Ambainis lower bounds
This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science
