An improvement on the complexity of factoring read-once Boolean functions

Discrete Applied Mathematics

Volumn 156, Issue 10, 2008, Pages 1633-1636

  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; Logic; Read once functions

Indexed keywords

ALGORITHMS; ARCHITECTURAL DESIGN; BOOLEAN ALGEBRA; COBALT; COBALT COMPOUNDS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; FUNCTIONS; GATES (TRANSISTOR); LEARNING ALGORITHMS; LOGIC CIRCUITS; LOGIC DESIGN; SWITCHING THEORY;

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; (MIN ,MAX ,+) FUNCTIONS; CHARACTERIZATION THEOREMS; CO-GRAPHS; CO-OCCURRENCE; COMPUTATIONAL LEARNING THEORY (COLT); PARTIAL K-TREES; POLYNOMIAL-TIME ALGORITHMS;

BOOLEAN FUNCTIONS;

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

References (15)

1. Angluin D., Hellerstein L., and Karpinski M. Learning read-once formulas with queries. J. ACM 40 (1993) 185-210
2. Bretscher A., Corneil D.G., Habib M., and Paul C. A simple linear time LexBFS cograph recognition algorithm (extended abstract). Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science, WG2003, Lecture Notes in Computer Science vol. 2880 (2003), Springer, Berlin 119-130
3. Corneil D., Lerchs H., and Burlingham L. Complement reducible graphs. Discrete Appl. Math. 3 (1981) 163-174
4. Corneil D., Perl Y., and Stewart L. A linear recognition algorithm for cographs. SIAM J. Comput. 14 (1985) 926-934
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980 (Second edition: Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam, 2004).
6. Golumbic M.C., and Gurvich V.A. Read-once functions. In: Crama Y., and Hammer P.L. (Eds). Boolean Functions: Theory, Algorithms and Applications (2008), Cambridge University Press, Cambridge, MA (Chapter 12)
7. M.C. Golumbic, A. Mintz, Factoring logic functions using graph partitioning, in: Proceedings of the IEEE/ACM International Conference on Computer Aided Design, November 1999, pp. 195-198.
8. 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, June 2001, pp. 109-114.
9. Golumbic M.C., Mintz A., and Rotics U. Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees. Discrete Appl. Math. 154 (2006) 1465-1677
10. Gurvich V.A. On repetition-free Boolean functions. Uspekhi Mat. Nauk. 32 (1977) 183-184 (in Russian, also, On read-once Boolean functions, Russian Math. Surveys 32 (1977) 183-184)
11. Gurvich V. Criteria for repetition-freeness of functions in the algebra of logic. Soviet Math. Dokl. 43 3 (1991) 721-726
12. Gurvich V., and Khachiyan L. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl. Math. 96-97 (1999) 363-373
13. Habib M., and Paul C. A simple linear time algorithm for cograph recognition. Discrete Appl. Math. 145 (2005) 183-197
14. Mintz A., and Golumbic M.C. Factoring Boolean functions using graph partitioning. Discrete Appl. Math. 149 (2005) 131-153
15. J. Peer, R. Pinter, Minimal decomposition of Boolean functions using non-repeating literal trees, in: Proceedings of the International Workshop on Logic and Architecture Synthesis, IFIP TC10 WD10.5, Grenoble, December 1995, pp. 129-139.