Login / Signup

Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops.

Marius BozgaRadu IosifFilip Konecný
Published in: VMCAI (2014)
Keyphrases
  • np complete
  • integer program
  • integer programming
  • np hard
  • optimization problems
  • decision problems
  • satisfiability problem
  • pspace complete
  • cost function
  • linear programming
  • linear program