New answers tagged planar-graphs
2
Below I show that reordering is not possible in any sense, so a new hardness proof from scratch is needed.
It's not even possible to reorder just one side if you don't eliminate redundant cluases. This is because any pair of adjacent (cyclically) variables can be in a clause and that gives you very little freedom, you can only reorder them by a cyclical ...
Top 50 recent answers are included
