Advertisement

On construction of A complete system of compression functions and on complexity of monotone realization of threshold boolean functions

  • S. A. Lozkin
  • A. A. Semenov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Krichevskii, R.E. Problemy Kybernet. No.36 (1979), 159–180, 280.Google Scholar
  2. [2]
    Sholomov,L.A. Problemy Kybernet. No. 21 (1969), 215–226, 261.Google Scholar
  3. [3]
    Krichevskii, R.E. Dokl. Akad. Nauk SSSR 151(1963), no.4, 803–806.Google Scholar
  4. [4]
    Aho,A.; Hopcroft,J.E.; Ullman,J.D. The design and analysis of computer algorithms. 1976, Addison-Wesley publishing company.Google Scholar
  5. [5]
    Kleiman, M.; Pippenger, N. Theoret. Comput. Sci. 7 (1978), no.3 325–332.Google Scholar
  6. [6]
    Friedman, J. SIAM J. Comput. 15 (1986), no.3, 641–654.Google Scholar
  7. [7]
    Lozkin S.A.; Semenov A.A. Theses of 7-th All-Union Conference ("The Problem of Theoretical Cybernetics"). Irkutsk, 1985, 124.Google Scholar
  8. [8]
    Discrete Mathematics and Mathematical Problems of Cybernetics, v.1. Moscow, "Nauka", 1974.Google Scholar
  9. [9]
    Valiant, L.G. J. of Algorithms, 5 (1984), no.3, 363–366.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • S. A. Lozkin
    • 1
  • A. A. Semenov
    • 1
  1. 1.Moscow State UniversityUSSR

Personalised recommendations