Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (extended abstract)

DOI10.1007/978-3-642-22685-4_11MaRDI QIDQ3087944zbMATH OpenOpenAlexFDO

Authors Tomoyuki Yamakami

Publication date 17 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_11

zbMATH Keywords

AP-reducibilitybounded degreeconstructibilitycounting CSPHolant problemsignaturesymmetrization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
• A trichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs

Cited in

(1)

• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems

This page was built for publication: Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (extended abstract)

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