Constant unary constraints and symmetric real-weighted counting CSPs

DOI10.1007/978-3-642-35261-4_27zbMATH Open1260.68185OpenAlexW101741123MaRDI QIDQ4909541FDOQ4909541

Authors: Tomoyuki Yamakami 

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Recommendations

• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
• The complexity of approximating conservative counting CSPs

zbMATH Keywords

counting constraint satisfaction problemAP-reducibleconstant unary constraintT-constructible

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Cited In (1)

• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems

This page was built for publication: Constant unary constraints and symmetric real-weighted counting CSPs

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