Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees

Discrete Applied Mathematics

Volumn 154, Issue 10, 2006, Pages 1465-1477

  Golumbic, Martin Charles ^a   Mintz, Aviad ^a   Rotics, Udi ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

Boolean functions; Cographs; k trees; Normal functions; Read once functions

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; FUNCTIONS; TREES (MATHEMATICS);

COGRAPHS; K-TREES; NORMAL FUNCTIONS; READ-ONCE FUNCTIONS;

GRAPH THEORY;

EID: 33646123306     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.09.016     Document Type: Article

References (28)

1. Angluin D., Hellerstein L., and Karpinski M. Learning read-once formulas with queries. J. ACM 40 (1993) 185-210
2. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8 (1987) 277-284
3. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308-340
4. Arnborg S., and Proskurowski A. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23 (1989) 11-24
5. Bodlaender H.L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996) 1305-1317
6. E. Boros, V. Gurvich, P.L. Hammer, Read-once decompositions of positive boolean functions, Rutcor Research Report RRR 01/24-94, 1994.
7. Boros E., Ibaraki T., and Makino K. Error-free and best-fit extensions of partially defined Boolean functions. Inform. and Comput. 140 (1998) 254-283
8. R. Brayton, C. McMullen, The decomposition and factorization of boolean expressions, in: Proceedings of the International Symposium on Circuits and Systems, Rome, May 1982, pp. 49-54.
9. Bshouty N., Hancock T.R., and Hellerstein L. Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates. J. Comput. System Sci. 50 (1995) 521-542
10. Corneil D., Lerchs H., and Burlingham L. Complement reducible graphs. Discrete Appl. Math. 3 (1981) 163-174
11. Corneil D., Perl Y., and Stewart L. A linear recognition algorithm for cographs. SIAM J. Comput. 14 (1985) 926-934
12. Courcelle B., and Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109 (1993) 49-82
13. Fredman M., and Khachiyan L. On the complexity of dualization of monotone disjunctive normal form. J. Algorithms 21 (1996) 618-628
14. Goldman S.A., Kearns M.J., and Schapire R.E. Exact identification of read-once formulas using fixed points of amplification functions. SIAM J. Comput. 22 4 (1993) 705-726
15. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, second ed., Academic Press, New York, 1980, Ann. Discrete Math. 57 (2004).
16. M.C. Golumbic, A. Mintz, Factoring logic functions using graph partitioning, in: Proceedings of IEEE/ACM International Conference on Computer Aided Design, November 1999, pp. 195-198.
17. M.C. Golumbic, A. Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, in: Proceedings of the 38th Design Automation Conference (DAC 2001), 2001, pp. 109-114.
18. Gurvich V. Criteria for repetition-freeness of functions in the algebra of logic. Soviet Math. Dokl. 43 3 (1991) 721-726
19. Habib M., Paul C., and Viennot L. Partition refinement techniques: an interesting algorithmic tool kit. Internat. J. Found. Comput. Sci. (IJFCS) 10 (1999) 147-170
20. Hayes J.P. The fanout structure of switching functions. J. ACM 22 (1975) 551-571
21. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Inform. Process. Lett. 27 (1988) 119-123
22. Karchmer M., Linial N., Newman I., Saks M., and Wigderson A. Combinatorial characterization of read-once formulae. Discrete Math. 114 (1993) 275-282
23. Mintz A., and Golumbic M.C. Factoring Boolean functions using graph partitioning. Discrete Appl. Math. 149 (2005) 131-153
24. Muroga S. Logic Design and Switching Theory (1979), Wiley, New York
25. I. Newman, On read-once boolean functions, in: Boolean Function Complexity: Selected Papers from LMS Symposium, Durham, July 1990, pp. 24-34.
26. J. Peer, R. Pinter, Minimal decomposition of boolean functions using non-repeating literal trees, in: IFIP, November 1995.
27. UCB, SIS: A System for Sequential Circuit Synthesis, UCB-Electronic Research Library M92/41, 1992.
28. A.R.R. Wang, Algorithms for multilevel logic optimization, Ph.D. Thesis, University of California, Berkeley, CA, 1989.