Login / Signup

Satisfiability Thresholds for Regular Occupation Problems.

Konstantinos PanagiotouMatija Pasch
Published in: ICALP (2019)
Keyphrases
  • np complete
  • optimization problems
  • problems involving
  • database
  • real time
  • objective function
  • computational complexity
  • relational databases
  • constraint satisfaction
  • decision problems
  • sat instances