5 citations · 6 across the 7 of their papers we have counts for
1 paper · 1 filter
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…