Login / Signup

The SAT+CAS method for combinatorial search with applications to best matrices.

Curtis BrightDragomir Z. DokovicIlias S. KotsireasVijay Ganesh
Published in: Ann. Math. Artif. Intell. (2019)
Keyphrases
  • cost function
  • computational complexity
  • objective function
  • pairwise
  • upper bound
  • phase transition
  • search problems
  • combinatorial search