by Kuo-Chin Chen and Simon Apers
Reference:
(Quantum) Complexity of Testing Signed Graph Clusterability (Kuo-Chin Chen and Simon Apers), In 19th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2024, September 9-13, 2024, Okinawa, Japan (Frédéric Magniez, Alex Bredariol Grilo, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, volume 310, 2024.
Bibtex Entry:
@inproceedings{DBLP:conf/tqc/ChenAH24,
author = {Kuo{-}Chin Chen and Simon Apers and Min{-}Hsiu Hsieh},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/tqc/ChenAH24.bib},
booktitle = {19th Conference on the Theory of Quantum Computation, Communication and Cryptography, {TQC} 2024, September 9-13, 2024, Okinawa, Japan},
date-added = {2024-09-05 10:54:46 +0200},
date-modified = {2024-09-05 10:54:46 +0200},
doi = {10.4230/LIPICS.TQC.2024.8},
editor = {Fr{\'{e}}d{\'{e}}ric Magniez and Alex Bredariol Grilo},
pages = {8:1--8:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = {LIPIcs},
timestamp = {Mon, 26 Aug 2024 16:40:52 +0200},
title = {(Quantum) Complexity of Testing Signed Graph Clusterability},
url = {https://doi.org/10.4230/LIPIcs.TQC.2024.8},
volume = {310},
year = {2024},
bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.TQC.2024.8}}