The complexity of planar Boolean \#CSP with complex weights

DOI10.1007/978-3-642-39206-1_44MaRDI QIDQ6827959zbMATH OpenFDO

Authors Heng Guo, Tyson Williams

Publication date 6 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://www.pure.ed.ac.uk/ws/files/105778292/planar_complex_CSP.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

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 Q6827959)