Fractal Parallelism: Solving SAT in Bounded Space and Time

DOI10.1007/978-3-642-17517-6_26MaRDI QIDQ3060740zbMATH OpenOpenAlexFDO

Authors Denys Duchier, Maxime Senot, Jérôme O. Durand-Lose

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_26

zbMATH Keywords

SATsignal machinefractalmassive parallelismmodel of computationabstract geometrical computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Reproducible efficient parallel SAT solving
• scientific article; zbMATH DE number 5510692
• An overview of parallel SAT solving
• scientific article; zbMATH DE number 828719
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
• Parallel SAT solving in bounded model checking
• A fast parallel SAT-solver -- efficient workload balancing
• The fractal dimension of SAT formulas

Cited in

(3)

• Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
• Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

This page was built for publication: Fractal Parallelism: Solving SAT in Bounded Space and Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060740)