The complexity of planar Boolean \#CSP with complex weights

DOI10.1016/J.JCSS.2019.07.005MaRDI QIDQ6827960zbMATH OpenFDO

Authors Heng Guo, Tyson Williams

Publication date 29 November 2019

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

constraint satisfaction problemsplanar graphscounting complexitydichotomy\#Pholographic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07)

This page was built for publication: The complexity of planar Boolean \#CSP with complex weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827960)