Login / Signup

Optimal bounds for the no-show paradox via SAT solving.

Felix BrandtChristian GeistDominik Peters
Published in: Math. Soc. Sci. (2017)
Keyphrases
  • sat solving
  • worst case
  • lower bound
  • upper bound
  • optimal solution
  • sat solvers
  • computational complexity
  • dynamic programming
  • integer programming
  • boolean satisfiability