When Satisfiability Solving Meets Symbolic Computation
The science of less-than-brute force.
When Satisfiability Solving Meets Symbolic Computation
The First Heidelberg Laureate Forum 2013
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved