The next whisky bar

DOI10.1007/978-3-319-34171-2_4MaRDI QIDQ5740176zbMATH OpenOpenAlexFDO

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

Publication date 25 July 2016

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-34171-2_4

Mathematics Subject Classification ID

Boolean functions (06E30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Give me another one!
• Minimal distance of propositional models
• As Close as It Gets
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• scientific article; zbMATH DE number 1759450

Cites work

• As Close as It Gets
• Bases for Boolean co-clones
• Complexity classifications of Boolean constraint satisfaction problems
• Give me another one!
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Some computational aspects of DISTANCE SAT
• The approximability of constraint satisfaction problems
• The complexity of satisfiability problems
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Cited in

(3)

• Minimal distance of propositional models
• The good, the bad and the ugly: ordinal and symbolic whisky analysis
• Give me another one!

This page was built for publication: The next whisky bar

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