The Next Whisky Bar
From MaRDI portal
Publication:5740176
DOI10.1007/978-3-319-34171-2_4zbMath1475.68136OpenAlexW2498506309MaRDI QIDQ5740176
Stefan Mengel, Mike Behrisch, Miki Hermann, 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
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30) Computational aspects of satisfiability (68R07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Some computational aspects of DISTANCE SAT
- Bases for Boolean co-clones
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The Approximability of Constraint Satisfaction Problems
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- As Close as It Gets
- Give Me Another One!
- The complexity of satisfiability problems