Sciweavers

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

72

Voted

ASPDAC
2004
ACM

76views Hardware» more ASPDAC 2004»

Efficient computation of canonical form for Boolean matching in large libraries

15 years 8 months ago

Efficient computation of canonical form for Boolean matching in large libraries

Download www.lsi-cad.com

Debatosh Debnath, Tsutomu Sasao

Real-time Traffic

ASPDAC 2004 |

claim paper

Related Content

» A new canonical form for fast boolean matching in logic synthesis and verification

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ASPDAC
Authors	Debatosh Debnath, Tsutomu Sasao

Comments (0)