Sciweavers

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

8

SAT
2010
Springer

favoriteEmaildiscussreport

161views Hardware» more SAT 2010»

On Moderately Exponential Time for SAT

13 years 8 months ago

On Moderately Exponential Time for SAT

Download cs.roosevelt.edu

Evgeny Dantsin, Alexander Wolpert

Real-time Traffic

Hardware | SAT 2010 |

claim paper

Related Content

» Algorithmics in Exponential Time

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

» A Duality between Clause Width and Clause Density for SAT

» An Exponential TimeSpace Speedup For Resolution

» Random 3SAT The Plot Thickens

» P systems with active membranes trading time for space

» Faster SAT and Smaller BDDs via Common Function Structure

» Random 3SAT and BDDs The Plot Thickens Further

» Resolution cannot polynomially simulate compressedBFS

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2010
Where	SAT
Authors	Evgeny Dantsin, Alexander Wolpert

Comments (0)