Inner-core and outer-core functions of partially defined Boolean functions

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 443-460

  Makino, Kazuhisa ^a   Ibaraki, Toshihide ^b  

^a OSAKA UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001480442     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00101-8     Document Type: Article

References (25)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. M. Anthony, N. Biggs, Computational Learning Theory, Cambridge University Press, Cambridge, 1992.
3. J.C. Bioch, T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Informat. Comput. 123 (1995) 50-63.
4. J.C. Bioch, Personal communication, 1995.
5. E. Boros, P.L. Hammer, T. Ibaraki, K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, in: W.L. Hsu, R.C.T. Lee (Eds.), ISA'91 Algorithms, Springer Lecture Notes in Computer Science, vol. 557, 1991, pp. 104-115; extended version SIAM J. Comput. 26 (1997) 93-109.
6. E. Boros, P.L. Hammer, T. Ibaraki, K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, in: W.L. Hsu, R.C.T. Lee (Eds.), ISA'91 Algorithms, Springer Lecture Notes in Computer Science, vol. 557, 1991, pp. 104-115; extended version SIAM J. Comput. 26 (1997) 93-109.
7. E. Boros, V. Gurvich, P.L. Hammer, T. Ibaraki, A. Kogan, Decomposability of partially defined Boolean functions, Discrete Appl. Math. 62 (1995) 51-75.
8. E. Boros, T. Ibaraki, K. Makino, Error-free and best-fit extensions of partially defined Boolean functions, Informat. Comput. 140 (1998) 254-283.
9. V. Chvátal, P.L. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977) 145-162.
10. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, Oxford, 1987.
11. Y. Crama, P.L. Hammer, T. Ibaraki, Cause-effect relationships and partially defined boolean functions, Ann. Oper. Res. 16 (1988) 299-326.
12. T. Eiter, G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput. 24 (1995) 1278-1304.
13. M. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618-628.
14. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
15. D.S. Johnson, M. Yannakakis, C.H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119-123.
16. D. Kavvadias, C.H. Papadimitriou, M. Sideri, On horn envelopes and hypergraph transversals, in: K.W. Ng et al. (Eds.), ISAAC'93 Algorithms and Computation, Springer Lecture Notes in Computer Science, vol. 762, 1993, pp. 399-405.
17. E. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput. 9 (1980) 558-565.
18. L. Lovász, M.D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.
19. K. Makino, T. Ibaraki, The maximum latency and identification of positive Boolean functions, in: D.Z. Du, X.S. Zhang (Eds.), ISAAC'94 Algorithms and Computation, Springer Lecture Notes in Computer Science, vol. 834, 1994, pp. 324-332; extended version SIAM J. Comput. 26 (1997) 1363-1383.
20. K. Makino, T. Ibaraki, The maximum latency and identification of positive Boolean functions, in: D.Z. Du, X.S. Zhang (Eds.), ISAAC'94 Algorithms and Computation, Springer Lecture Notes in Computer Science, vol. 834, 1994, pp. 324-332; extended version SIAM J. Comput. 26 (1997) 1363-1383.
21. K. Makino, K. Hatanaka, T. Ibaraki, Horn extensions of a partially defined Boolean function, SIAM J. Comput. 28 (1999) 2168-2186.
22. S. Muroga, Threshold Logic and Its Applications, Wiley-Interscience, New York, 1971.
23. J.S. Provan, M.O. Ball, Efficient recognition of matroids and 2-monotonic systems, in: R. Ringeisen, F. Roberts (Eds.), Applications of Discrete Mathematics, SIAM, Philadelphia, 1988, pp. 122-134.
24. J.R. Quinlan, Induction of decision trees, Mach. Learning 1 (1986) 81-106.
25. K.G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, Dordrecht, 1990.