NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths
Theory of Computing Systems · 2026-06 · 70 (2)
DOI: 10.1007/s00224-026-10262-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory of Computing Systems, online erschienen am 02.04.2026. Verfasst von Hideo Bannai und 3 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Gefördert von: JSPS.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- JSPS
Zitieren
APA
Bannai, H., Goto, K., Kanda, S., & Köppl, D. (2026). NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths. Theory of Computing Systems, 70(2). https://doi.org/10.1007/s00224-026-10262-1
Vancouver
Bannai H, Goto K, Kanda S, Köppl D. NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths. Theory of Computing Systems. 2026;70(2). doi:10.1007/s00224-026-10262-1
BibTeX
@article{Bannai2026,
author = {Bannai, Hideo and Goto, Keisuke and Kanda, Shunsuke and Köppl, Dominik},
title = {NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths},
journal = {Theory of Computing Systems},
year = {2026},
volume = {70},
number = {2},
doi = {10.1007/s00224-026-10262-1}
}
EUVIMED