Factoring and recognition of read-once functions using cographs and normality

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 109-114

  Golumbic, M C ^a   Mintz, A ^a   Rotics, U ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Cograph; Factoring; Normality; Read once functions

Indexed keywords

ALGORITHMS; COMPUTER AIDED ENGINEERING; GRAPH THEORY; SEQUENTIAL CIRCUITS; SUBROUTINES;

GRAPH PARTIONING ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 0034855429     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378239.378356     Document Type: Conference Paper

References (13)

1. The decomposition and factorization of boolean expressions
2. Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates
3. Complement reducible graphs
4. A linear recognition algorithm for cographs
5. Factoring logic functions using graph partitioning
6. Criteria for repetition-freeness of functions in the algebra of logic
7. Partition refinement techniques: An interesting algorithmic tool kit
8. The fanout structure of switching functions
9. Combinatorial characterization of read-once formulae
10. On read-once boolean functions
11. Minimal decomposition of boolean functions using non-repeating literal trees