Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

120

Voted

ISAAC
2010
Springer

216views Algorithms» more ISAAC 2010»

Fractal Parallelism: Solving SAT in Bounded Space and Time

15 years 17 days ago

Fractal Parallelism: Solving SAT in Bounded Space and Time

Download www.univ-orleans.fr

Denys Duchier, Jérôme Durand-Lose, Ma

Real-time Traffic

Algorithms | ISAAC 2010 |

claim paper

Related Content

» A Quantum TimeSpace Lower Bound for the Counting Hierarchy

» Solving HPP and SAT by P Systems with Active Membranes and Separation Rules

» SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

» TimeSpace Tradeoffs for Satisfiability

» Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT

» Game Characterizations and the PSPACECompleteness of Tree Resolution Space

» New Bounds for MAXSAT by Clause Learning

» Resolution versus Search Two Strategies for SAT

» BoundedResponseTime SelfStabilizing OPS5 Production Systems

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	ISAAC
Authors	Denys Duchier, Jérôme Durand-Lose, Maxime Senot

Comments (0)