Quantum and classical query complexities for determining connectedness of matroids
Journal of Computer and System Sciences · 2026-05 · 157 · 103758
DOI: 10.1016/j.jcss.2026.103758 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-05. Verfasst von Xiaowei Huang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Guangzhou Municipal Science and Technology Program key projects.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Guangzhou Municipal Science and Technology Program key projects
Zitieren
APA
Huang, X., Feng, S., & Li, L. (2026). Quantum and classical query complexities for determining connectedness of matroids. Journal of Computer and System Sciences, 157, 103758. https://doi.org/10.1016/j.jcss.2026.103758
Vancouver
Huang X, Feng S, Li L. Quantum and classical query complexities for determining connectedness of matroids. Journal of Computer and System Sciences. 2026;157:103758. doi:10.1016/j.jcss.2026.103758
BibTeX
@article{Huang2026,
author = {Huang, Xiaowei and Feng, Shiguang and Li, Lvzhou},
title = {Quantum and classical query complexities for determining connectedness of matroids},
journal = {Journal of Computer and System Sciences},
year = {2026},
volume = {157},
pages = {103758},
doi = {10.1016/j.jcss.2026.103758}
}
EUVIMED