Fractal parallelism: Solving sat in bounded space and time - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Fractal parallelism: Solving sat in bounded space and time

Abstract

Abstract geometrical computation can solve NP-complete problems efficiently: any boolean constraint satisfaction problem, instance of SAT, can be solved in bounded space and time with simple geometrical constructions involving only drawing parallel lines on a Euclidean space-time plane. Complexity as the maximal length of a sequence of consecutive segments is quadratic. The geometrical algorithm achieves massive parallelism: an exponential number of cases are explored simultaneously. The construction relies on a fractal pattern and requires the same amount of space and time independently of the SAT formula.
No file

Dates and versions

hal-00511230 , version 1 (24-08-2010)

Identifiers

  • HAL Id : hal-00511230 , version 1

Cite

Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Fractal parallelism: Solving sat in bounded space and time. ISAAC '10, Dec 2010, South Korea. pp.279-290. ⟨hal-00511230⟩
90 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More