
What Maximum Clique Algorithms Can Teach Us, And Vice-Versa
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ue4ZEXwLwaM
Ciaran Mccreesh (University of Glasgow)
https://simons.berkeley.edu/talks/what-maximum-clique-algorithms-can-teach-us-and-vice-versa
Beyond Satisfiability
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Ciaran Mccreesh
Beyond Satisfiability