 |
|
|
|
| HAL: hal-00511230, version 1 |
| Detailed view |  Export this paper |
|
|
| ISAAC '10, Korea, Republic Of (2010) |
|
|
|
|
| Fractal parallelism: Solving sat in bounded space and time |
|
|
| Denys Duchier 1Jérôme Durand-Lose 1 |
|
|
| (2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| LIFO |
|
|
|
|
| Subject | : | Computer Science/Computational Complexity Computer Science/Logic in Computer Science |
|
|
| Abstract geometrical computation – Signal machine – Fractal – SAT – Massive parallelism – Model of computation |
|
| hal-00511230, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00511230 | |
| oai:hal.archives-ouvertes.fr:hal-00511230 | |
| From: Jérôme Durand-Lose | |
| Submitted on: Tuesday, 24 August 2010 11:20:14 | |
| Updated on: Friday, 29 July 2011 16:38:19 | |
