Back to Results
First PageMeta Content
Boolean algebra / Computing / Formal methods / Electronic design automation / Boolean satisfiability problem / Boolean network / Model checking / Canonical form / Lookup table / Theoretical computer science / Logic / Mathematics


SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko Department of EECS University of California, Berkeley [removed]
Add to Reading List

Document Date: 2004-04-30 02:47:03


Open Document

File Size: 208,59 KB

Share Result on Facebook

Company

Fujitsu / CNF / MVSIS Group / Intel / /

/

Facility

Microelectronics Center / EXTRA library / EECS University of California / /

IndustryTerm

binary networks / binary network / industrial tools / classical algorithm / logic networks / deterministic binary network / window computation algorithm / large industrial networks / sub-network / nondeterministic networks / nondeterministic multi-valued networks / non-deterministic multi-valued networks / multi-level network / multi-level networks / non-deterministic multi-valued network / same method to larger networks / larger sub-network / multi-valued don’t-care computation algorithm / search algorithm / don’t-care computation algorithm / /

OperatingSystem

Windows XP / /

Organization

Network Optimization Alan Mishchenko Department / UC Berkeley / University of California / Berkeley / Robert K. Brayton Department / Microelectronics Center of North Carolina / /

Person

Robert K. Brayton / Jordi Cortadella / A. Kuehlmann / V / Alan Mishchenko / /

ProgrammingLanguage

C++ / /

ProvinceOrState

North Carolina / /

TVStation

TFO / /

Technology

SAT-based don’t-care computation algorithm / BDD-based algorithms / RAM / search algorithm / windowing algorithm / corresponding BDD-based algorithm / classical algorithm / multi-valued don’t-care computation algorithm / simulation / window computation algorithm / CAD / /

URL

http /

SocialTag