The maximum latency and identification of positive Boolean functions

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1363-1383

  Makino, Kazuhisa ^a   Ibaraki, Toshihide ^b  

^a OSAKA UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Dualization; Identification of Boolean functions; Maximum latency; Partial function; Positive Boolean function; Transversal; Unknown vector

Indexed keywords

EID: 0000890387     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794276324     Document Type: Article

References (29)

1. D. ANGLUIN, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
2. M. ANTHONY AND N. BIGGS, Computational Learning Theory, Cambridge University Press, London, 1992.
3. M. O. BALL AND J. S. PROVAN, Disjoint products and efficient computation of reliability, Oper. Res., 36 (1988), pp. 703-715.
4. P. BERTOLAZZI AND A. SASSANO, An O(mn) time algorithm for regular set-covering problems, Theoret. Comput. Sci., 54 (1987), pp. 237-247.
5. J. C. BIOCH AND T. IBARAKI, Decompositions of positive self-dual Boolean functions, Discrete Math., 140 (1995), pp. 23-46.
6. J. C. BIOCH AND T. IBARAKI, Complexity of identification and dualization of positive Boolean functions, Inform. and Comput., 123 (1995), pp. 50-63.
7. E. BOROS, P. L. HAMMER, T. IBARAKI, AND K. KAWAKAMI, Identifying 2-monotonic positive Boolean functions in polynomial time, in ISA'91 Algorithms, W. L. Hsu and R. C. T. Lee, eds., Springer Lecture Notes in Computer Science 557, Springer-Verlag, Berlin, 1991, pp. 104-115.
8. E. BOROS, P. L. HAMMER, T. IBARAKI, AND K. KAWAKAMI, Polynomial time recognition of 2-monotonic positive boolean functions given by an oracle, SIAM J. Comput., 26 (1997), pp. 93-109.
9. N. H. BSHOUTY, Exact learning via the monotone theory, Inform. and Comput., 123 (1995), pp. 146-153.
10. C. J. COLBOURN, The Combinatorics of Network Reliability, Oxford University Press, London, 1987.
11. Y. CRAMA, Dualization of regular Boolean functions, Discrete Appl. Math., 16 (1987), pp. 79-85.
12. Y. CRAMA, P. L. HAMMER, AND T. IBARAKI, Cause-effect relationships and partially defined Boolean functions, Ann. Oper. Res., 16 (1988), pp. 299-326.
13. T. EITER AND G. GOTTLOB, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput., 24 (1995), pp. 1278-1304.
14. M. FREDMAN AND L. KHACHIYAN, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, 21 (1996), pp. 618-628.
15. D. N. GAINANOV, On one criterion of the optimality of an algorithm for evaluating monotonic Boolean functions, USSR Comput. Math. Math. Phys., 24 (1984), pp. 176-181.
16. H. GARCIA-MOLINA AND D. BARBARA, How to assign votes in a distributed system, J. ACM, 32 (1985), pp. 841-860.
17. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, W. H. Freeman, New York, 1979.
18. T. IBARAKI AND T. KAMEDA, A theory of coteries: Mutual exclusion in distributed systems, IEEE Trans. Parallel Distrib. Systems, 4 (1993), pp. 779-794.
19. D. S. JOHNSON, M. YANNAKAKIS, AND C. H. PAPADIMITRIOU, On generating all maximal independent sets, Inform. Process. Lett., 27 (1988), pp. 119-123.
20. V. K. KOROBKOV AND T. L. REZNIK, Certain algorithms for the computation of monotonic functions in the algebra of logic, Soviet Math. Dokl., 3 (1962), pp. 1763-1767.
21. E. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput., 9 (1980), pp. 558-565.
22. K. MAKINO AND T. IBARAKI, The maximum latency of partially defined positive Boolean functions, Trans. IEICE, J76-D-1 (1993), pp. 409-416. (In Japanese.)
23. K. MAKINO AND T. IBARAKI, The maximum latency and identification of positive Boolean functions, in Proceedings 5th International Symposium on Symbolic and Algebraic Computation (ISSAC'94), D. Z. Du and X. S. Zhang, eds., Lecture Notes in Computer Science 834, Springer-Verlag, Berlin, 1994, pp. 324-332.
24. K. MAKINO AND T. IBARAKI, A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, in Proceedings 6th International Symposium on Symbolic and Algebraic Computation (ISSAC'95), J. Staples et al., eds., Lecture Notes in Computer Science 1004, Springer-Verlag, Berlin, 1995, pp. 291-300.
25. S. MUROGA, Threshold Logic and Its Applications, Wiley-Interscience, New York, 1971.
26. U. N. PELED AND B. SIMEONE, Polynomial-time algorithm for regular set-covering and threshold synthesis, Discrete Appl. Math., 12 (1985), pp. 57-69.
27. R. REITER, A theory of diagnosis from first principles, Artif. Intell., 32 (1987), pp. 57-95.
28. L. G. VALIANT, A theory of the learnable, Comm. ACM, 27 (1984), pp. 1134-1142.
29. D. J. A. WELSH, Matroid Theory, Academic Press, New York, 1976.