Login / Signup
Optimal Bounds for the No-Show Paradox via SAT Solving.
Felix Brandt
Christian Geist
Dominik Peters
Published in:
AAMAS (2016)
Keyphrases
</>
sat solving
worst case
optimal solution
lower bound
upper bound
boolean satisfiability
boolean optimization
information retrieval
search space
dynamic programming