The Complexity of Planar Boolean #CSP with Complex Weights release_ormuxbgvfjbr5kuve4ybzzgjmi

by Heng Guo, Tyson Williams

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2013   p516-527

Archived Files and Locations

application/pdf  542.9 kB
file_2pm7m2zzpzfwtlsjtfbde6ytoe
web.archive.org (webarchive)
pages.cs.wisc.edu (web)
application/pdf  395.0 kB
file_zmvmnlsfgzbptljxh2fnd6mqfi
web.archive.org (webarchive)
pages.cs.wisc.edu (web)
web.archive.org (webarchive)
application/pdf  321.9 kB
file_fgyr54sqnjag3j5ued2sniaplq
pages.cs.wisc.edu (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
pages.cs.wisc.edu (web)
application/pdf  452.9 kB
file_htyt6qc6fnhj3hpnfbhu6xsro4
web.archive.org (webarchive)
web.archive.org (webarchive)
pages.cs.wisc.edu (web)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2013
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: dccde241-7af9-475b-aa62-9efc7c0585cf
API URL: JSON