As Close as It Gets

DOI10.1007/978-3-319-30139-6_18MaRDI QIDQ2803825zbMATH OpenOpenAlexFDO

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

Publication date 3 May 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-30139-6_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean programming (90C09) Computational aspects of satisfiability (68R07)

Recommendations

• When Close Enough is Close Enough
• Closer
• Close to close packing
• scientific article; zbMATH DE number 1971743
• Perfecting the nearly perfect
• Approximating Matches Made in Heaven
• Almost H-closed

Cites work

• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1390075 (Why is no real title available?)
• A Theorem on Boolean Matrices
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Bases for Boolean co-clones
• Closure properties of constraints
• Complexity classifications of Boolean constraint satisfaction problems
• Give me another one!
• Hardness of approximating the minimum distance of a linear code
• On the Hamming distance of constraint satisfaction problems.
• Partial Polymorphisms and Constraint Satisfaction Problems
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• The complexity of satisfiability problems
• Weak bases of Boolean co-clones

Cited in

(9)

• Minimal distance of propositional models
• On the Hamming distance of constraint satisfaction problems.
• Recent Advances in Constraints
• scientific article; zbMATH DE number 7536562 (Why is no real title available?)
• Time complexity of constraint satisfaction via universal algebra
• Some computational aspects of DISTANCE SAT
• ALMOST PRECOVERS
• Give me another one!
• The next whisky bar

This page was built for publication: As Close as It Gets

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