Sciweavers

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

89

ICCD
2006
IEEE

96views Hardware» more ICCD 2006»

An Efficient, Scalable Hardware Engine for Boolean SATisfiability

15 years 11 months ago

An Efficient, Scalable Hardware Engine for Boolean SATisfiability

Download iccd.et.tudelft.nl

Mandar Waghmode, Kanupriya Gulati, Sunil P. Khatri

Real-time Traffic

Hardware | ICCD 2006 |

claim paper

Related Content

» SAT and ATPG Boolean engines for formal hardware verification

» Efficient SAT solving for nonclausal formulas using DPLL graphs and watched cuts

» Efficient Exact Spare Allocation via Boolean Satisfiability

» Conflict driven learning in a quantified Boolean Satisfiability solver

» Beaver Engineering an Efficient SMT Solver for BitVector Arithmetic

» Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems

» Routing in Optical and NonOptical Networks using Boolean Satisfiability

» Chaff Engineering an Efficient SAT Solver

» Scalable formula decomposition for propositional satisfiability

Post Info
More Details (n/a)

Added	16 Mar 2010
Updated	16 Mar 2010
Type	Conference
Year	2006
Where	ICCD
Authors	Mandar Waghmode, Kanupriya Gulati, Sunil P. Khatri, Weiping Shi

Comments (0)