Using SAT Solvers to Investigate Ramsey-Type NumbersOctober 19, 2016 Track: General We formulated the definition of a Ramsey-type numbers as a boolean satisfiability problem. Then we modified existing satisfiability solver algorithms based on the characteristics of the formula, which allowed us to find a new lower bounds for this number. Speaker(s)
|