Crossref
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
Baltic Journal of Modern Computing · 2016
DOI: 10.22364/bjmc.2016.4.4.10 ↗Kurz gefasst
Fachartikel in der Zeitschrift Baltic Journal of Modern Computing, 2016. Verfasst von Kaspars Balodis und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Balodis, K., & Iraids, J. (2016). Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. Baltic Journal of Modern Computing. https://doi.org/10.22364/bjmc.2016.4.4.10
Vancouver
Balodis K, Iraids J. Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. Baltic Journal of Modern Computing. 2016. doi:10.22364/bjmc.2016.4.4.10
BibTeX
@article{Balodis2016,
author = {Balodis, Kaspars and Iraids, Jānis},
title = {Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection},
journal = {Baltic Journal of Modern Computing},
year = {2016},
doi = {10.22364/bjmc.2016.4.4.10}
}
EUVIMED