Solving Q-SAT in bounded space and time by geometrical computation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Solving Q-SAT in bounded space and time by geometrical computation

Résumé

Abstract geometrical computation can solve PSPACE-com\-plete problems efficiently: any quantified boolean formula, instance of Q-SAT -- the problem of satisfiability of quantified boolean formula -- can be decided in bounded space and time with simple geometrical constructions involving only drawing parallel lines on an Euclidean space-time. Complexity as the maximal length of a sequence of consecutive segments is quadratic. We use the continuity of the real line to cover all the possible boolean valuations by a recursive tree structure relying on a fractal pattern: an exponential number of cases are explored simultaneously by a massive parallelism.
Fichier principal
Vignette du fichier
2011_CiE.pdf (331.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00605661 , version 1 (05-07-2011)

Identifiants

  • HAL Id : hal-00605661 , version 1

Citer

Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Solving Q-SAT in bounded space and time by geometrical computation. Models of computability in context, 7th Int. Conf. Computability in Europe, Jun 2011, Sofia, Bulgaria. pp.76-86. ⟨hal-00605661⟩
115 Consultations
250 Téléchargements

Partager

Gmail Facebook X LinkedIn More