Advertisement

A Linear Time Algorithm for Recognizing Regular Boolean Functions

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

Abstract

A positive (or monotone) Boolean function is regular if its variables are naturally ordered, left to right, by decreasing strength, so that shifting the non-zero component of any true vector to the left always yields another true vector. In this paper, we propose a simple linear time algorithm to recognize whether a positive function is regular.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. Aizenstein, T. Hegedus, L. Hellerstein and L. Pitt, Complexity theoretic hardness results for query learning, Computational Complexity, 7 (1998) 19–53.Google Scholar
  2. 2.
    M. O. Ball and J. S. Provan, Disjoint products and efficient computation of reliability, Operations Research, 36 (1988) 703–715.Google Scholar
  3. 3.
    P. Bertolazzi and A. Sassano, An O(mn) time algorithm for regular set-covering problems, Theoretical Computer Science, 54 (1987) 237–247.Google Scholar
  4. 4.
    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. Computing, 26 (1997) 93–109.Google Scholar
  5. 5.
    V. Chvátal and P. L. Hammer, Aggregation of inequalities in integer programming, Annals of Discrete Mathematics, 1 (1977) 145–162.Google Scholar
  6. 6.
    Y. Crama, Dualization of regular Boolean functions, Discrete Applied Mathematics, 16 (1987) 79–85.Google Scholar
  7. 7.
    N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984) 373–396.Google Scholar
  8. 8.
    L. G. Khachiyan, A polynomial algorithm in linear programming, Soviet Mathematics Doklady, 20 (1979) 191–194.Google Scholar
  9. 9.
    K. Makino and T. Ibaraki, The maximum latency and identification of positive Boolean functions, SIAM Journal on Computing, 26 (1997) 1363–1383.Google Scholar
  10. 10.
    K. Makino and T. Ibaraki, A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, Journal of Algorithms, 26 (1998) 291–305.Google Scholar
  11. 11.
    K. Makino, A linear time algorithm for recognizing regular Boolean functions, RUTCOR Research Report RRR 32-98, Rutgers University 1998.Google Scholar
  12. 12.
    S. Muroga, “Threshold Logic and Its Applications,” Wiley-Interscience, 1971.Google Scholar
  13. 13.
    U. N. Peled and B. Simeone, Polynomial-time algorithm for regular set-covering and threshold synthesis, Discrete Applied Mathematics, 12 (1985) 57–69.Google Scholar
  14. 14.
    J. S. Provan and M. O. Ball, Efficient recognition of matroids and 2-monotonic systems, in “Applications of Discrete Mathematics,” (R. Ringeisen and F. Roberts, Eds.), pp. 122–134, SIAM, Philadelphia, 1988.Google Scholar
  15. 15.
    R. O. Winder, “Threshold Logic,” Doctoral dissertation, Mathematics Department, Princeton University, 1962.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Kazuhisa Makino
    • 1
  1. 1.Department of Systems and Human Science, Graduate School of Engineering ScienceOsaka UniversityToyonakaJapan

Personalised recommendations