How to use watched literals (or, rather, vertices) to do breadth-first search in Horn hyperdigraphs.
Why math is for everybody.
What I remember from the first computer-related conference I attended.
In this post I review some of the Coursera courses that I completed.
How to encode a cardinality constraint as boolean constraints.
Everybody thinks they understand depth-first search.
The algorithm is indeed simple.
But — I think — it is deceptively simple.
In this post I play with some code.
This is an exercise proposed by Timothy Gowers: Write down all you think of while trying to solve a math problem.