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
2
search results - page 1 / 1
»
Efficient computation of canonical form for Boolean matching...
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
ASPDAC
2004
ACM
76
views
Hardware
»
more
ASPDAC 2004
»
Efficient computation of canonical form for Boolean matching in large libraries
14 years 25 days ago
Download
www.lsi-cad.com
Debatosh Debnath, Tsutomu Sasao
claim paper
Read More »
23
click to vote
DAC
2005
ACM
169
views
Computer Architecture
»
more
DAC 2005
»
A new canonical form for fast boolean matching in logic synthesis and verification
14 years 8 months ago
Download
atrak.usc.edu
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »