Login / Signup

Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm.

Xiaojun SunIrina IlioaeaPriyank KallaFlorian Enescu
Published in: CP (2016)
Keyphrases
  • learning algorithm
  • search space
  • dynamic programming
  • computational complexity
  • objective function
  • np hard
  • linear programming
  • randomly generated
  • numerically stable
  • optimal solution
  • simulated annealing