Recent online discussion about computational complexity included the notion that the structure of solutions of SAT might be useful in proving separation results. I want to point out a further obstacle to this idea. (more…)
Theoretical computer science and other fun topics, through the lens of constraint satisfaction.
Create a free website or blog at WordPress.com.