Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

Denys Duchier, Jérôme Durand-Lose, Maxime Senot

Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific s…