New algorithm for the binate covering problem and its application to the minimization of boolean relations

IEEE/ACM International Conference on Computer-Aided Design

Volumn , Issue , 1992, Pages 417-420

  Jeong, Seh Woong ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; DECISION THEORY; MINIMIZATION OF SWITCHING NETS; STATE ASSIGNMENT;

BINARY DECISION DIAGRAM (BDD); BINATE COVERING PROBLEM (BCP); MINIMUM COST ASSIGNMENT; SET COVERING PROBLEM;

BOOLEAN FUNCTIONS;

EID: 0026981218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)