As Close as It Gets
DOI10.1007/978-3-319-30139-6_18zbMATH Open1475.68217OpenAlexW2493315024MaRDI QIDQ2803825FDOQ2803825
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
Recommendations
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)
Cites Work
- A Theorem on Boolean Matrices
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Complexity classifications of Boolean constraint satisfaction problems
- Closure properties of constraints
- The complexity of satisfiability problems
- Title not available (Why is that?)
- Hardness of approximating the minimum distance of a linear code
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Weak bases of Boolean co-clones
- Partial Polymorphisms and Constraint Satisfaction Problems
- Title not available (Why is that?)
- Bases for Boolean co-clones
- On the Hamming distance of constraint satisfaction problems.
- Give me another one!
Cited In (9)
- Minimal distance of propositional models
- On the Hamming distance of constraint satisfaction problems.
- Recent Advances in Constraints
- Title not available (Why is that?)
- 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)
