The maximum latency and identification of positive Boolean functions

  • Kazuhisa Makino
  • Toshihide Ibaraki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


Consider the problem of identifying min T(f) and max F(f) of a positive (i.e., monotone) Boolean function f, by using membership queries only, where min T(f) (maxF(f)) denotes the set of minimal true vectors (maximal false vectors) of f. It is known that an incrementally polynomial algorithm exists if and only if there is a polynomial time algorithm to check the existence of an unknown vector for given sets MT\(\subseteq \) min T(f) and MF\(\subseteq \) max F(f). Unfortunately, however, the complexity of this problem is still unknown. To answer this question partially, we introduce in this paper a measure for the difficulty of finding an unknown vector, which is called the maximum latency. If the maximum latency is constant, then an unknown vector can be found in polynomial time and there is an incrementally polynomial algorithm for identification. Several subclasses of positive functions are shown to have constant maximum latency, e.g., 2-monotonic positive functions, Δ-partial positive threshold functions and matroid functions, while the class of general positive functions has maximum latency not smaller than [n/4]+1 and the class of positive k-DNF functions has Ω(√n) maximum latency.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Angluin, Queries and concept learning, Machine Learning, 2 (1988) 319–342.Google Scholar
  2. 2.
    J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, RUTCOR Research Report RRR 25-93, Rutgers University, 1993.Google Scholar
  3. 3.
    E. Boros, P. L. Hammer, T. Ibaraki and K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, ISA '91 Algorithms, edited by W. L. Hsu and R. C. T. Lee, Springer Lecture Notes in Computer Science, 557 (1991) 104–115.Google Scholar
  4. 4.
    Y. Crama, P. L. Hammer and T. Ibaraki, Cause-effect relationships and partially defined boolean functions, Annals of Operations Research, 16 (1988) 299–326.MathSciNetGoogle Scholar
  5. 5.
    T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, Technical Report CD-TR 91/16, Christial Doppler Labor für Expertensysteme, Technische Universität Wien, January 1991.Google Scholar
  6. 6.
    T. Ibaraki and T. Kameda, A Theory of coteries: Mutual exclusion in distributed systems, IEEE Trans. on Parallel and Distributed Systems, 4 (1993) 779–794.Google Scholar
  7. 7.
    D. S. Johnson, M. Yannakakis and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 27 (1988) 119–123.Google Scholar
  8. 8.
    K. Makino and T. Ibaraki, The maximum latency and identification of positive Boolean functions, Technical Report, Kyoto University, in preparation.Google Scholar
  9. 9.
    S. Muroga, Threshold Logic and Its Applications, Wiley-Interscience, 1971.Google Scholar
  10. 10.
    R. Reiter, A theory of Diagnosis from first principles, Artificial Intelligence, 32 (1987) 57–95.CrossRefGoogle Scholar
  11. 11.
    L. G. Valiant, A theory of the learnable, Communications of the ACM, 27 (1984) 1134–1142.CrossRefGoogle Scholar
  12. 12.
    D. J. A. Welsh, Matroid Theory, Academic Press, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Kazuhisa Makino
    • 1
  • Toshihide Ibaraki
    • 1
  1. 1.Department of Applied Mathematics and Physics, Faculty of EngineeringKyoto UniversityKyotoJapan

Personalised recommendations