2 citations · 3 across the 8 of their papers we have counts for
1 paper · 1 filter
Dr Serge Burckel
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorit…