Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
37
click to vote
ISAAC
2010
Springer
favorite
Email
discuss
report
216
views
Algorithms
»
more
ISAAC 2010
»
Fractal Parallelism: Solving SAT in Bounded Space and Time
13 years 8 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision