Give me another one!

DOI10.1007/978-3-662-48971-0_56MaRDI QIDQ3459903zbMATH OpenOpenAlexFDO

Authors Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer

Publication date 11 January 2016

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

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_56

Mathematics Subject Classification ID

Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Minimal distance of propositional models
• As Close as It Gets
• The next whisky bar
• On the Hamming distance of constraint satisfaction problems.
• The approximability of constraint satisfaction problems

Cited in

(5)

• Minimal distance of propositional models
• As Close as It Gets
• Time complexity of constraint satisfaction via universal algebra
• The next whisky bar
• A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms

This page was built for publication: Give me another one!

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