Sciweavers

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

29

SAT
2005
Springer

favoriteEmaildiscussreport

117views Hardware» more SAT 2005»

A Branching Heuristics for Quantified Renamable Horn Formulas

14 years 4 months ago

A Branching Heuristics for Quantified Renamable Horn Formulas

Download users.ecs.soton.ac.uk

Sylvie Coste-Marquis, Daniel Le Berre, Florian Let

Real-time Traffic

SAT 2005 |

claim paper

Related Content

» Computing Horn Strong Backdoor Sets Thanks to Local Search

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	SAT
Authors	Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe

Comments (0)