On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 363-373

  Gurvich, V ^a   Khachiyan, L ^b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Conjunctive normal form; Disjunctive normal form; Dualization; Incremental polynomial time; Monotone Boolean formula; Monotone Boolean function; NP hardness; Positional game; Prime implicant; Prime implicate; Quasi polynomial time; Relay contact circuit

Indexed keywords

EID: 17944387346     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00099-2     Document Type: Article

References (15)

1. J.C. Bioch, T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Inform. and Comput. 123 (1995) 50-63.
2. E. Boros, V. Gurvich, P.L. Hammer, Dual subimplicants of positive Boolean functions, RUTCOR Research Report 11-93, Rutgers Center for Operations Research, Rutgers University, New Brunswick, New Jersey 08903, 1993.
3. Y. Crama, Dualization of regular Boolean functions, Discrete Appl. Math. 16 (1987) 79-85.
4. T. Eiter, G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput. 24 (6) (1995) 1278-1304.
5. M. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618-628.
6. V. Gurvich, To theory of multistep games, USSR Comput. Math. Math. Phys. 13 (6) (1973) 1485-1500.
7. V. Gurvich, Solvability of positional games in pure strategies, USSR Comput. Math. Math. Phys. 15 (2) (1975) 357-371.
8. V. Gurvich, On repetition-free Boolean functions, Uspekhi Mat. Nauk 32 (1977) 183-184 (in Russian).
9. M.R. Jerrum, L.G. Valiant, V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43 (1986) 169-188.
10. D.S. Johnson, M. Yannakakis, C.H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119-123.
11. M. Karchmer, N. Linial, I. Newman, M. Saks, A. Widgerson, Combinatorial characterization of read-once formulae, Discrete Math. 114 (1993) 275-282.
12. R.M. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56-64.
13. U.N. Peled, B. Simeone, An O(nm) - time algorithm for computing the dual of a regular Boolean function, Discrete Appl. Math. 49 (1994) 309-323.
14. C.E. Shannon, A symbolic analysis of relay and switching circuits, Trans. AIEE 57 (1938) 713-723.
15. E. Zermelo, Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels, Proceedings of the 5th Congress of Mathematicians, Cambridge 1912, Cambridge Univ. Press, Cambridge, 1913, pp. 501-504.