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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Considering Circuit Observability Don't Cares in CNF Satisfi...
Sort
relevance
views
votes
recent
update
View
thumb
title
82
click to vote
DATE
2005
IEEE
102
views
Hardware
»
more
DATE 2005
»
Considering Circuit Observability Don't Cares in CNF Satisfiability
15 years 11 months ago
Download
hal.archives-ouvertes.fr
Zhaohui Fu, Yinlei Yu, Sharad Malik
claim paper
Read More »
153
click to vote
VLSID
2007
IEEE
153
views
VLSI
»
more
VLSID 2007
»
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
16 years 6 months ago
Download
www.gigascale.org
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »