When Computer Algebra Meets Satisfiability: A New Approach to Combinatorial Mathematics
https://youtu.be/h-LEf4YnWhQ Speakers: Curtis Bright, School of Computer Science, University of Windsor and Vijay Ganesh, Dept. of Electrical and Computer Engineering, University of Waterloo Title: When Computer Algebra Meets Satisfiability: A New Approach to Combinatorial Mathematics Abstract: Solvers for the Boolean satisfiability (SAT) problem have been increasingly used to resolve problems in mathematics due to their […]