Skip to main content
SpringerLink
Log in

Lower bounds on the complexity of local circuits

Preliminary report

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.Alon and R.B.Boppana: The monotone circuit complexity of Boolean functions, manuscript (1985)— to appear in Combinatorica.

    Google Scholar 

  2. A.E. Andreev: On one method of obtaining lower bounds of individual monotone function complexity, Dokl. Akad. Nauk SSSR, 282 (1985), pp. 1033–1037.

    Google Scholar 

  3. P.E. Dunne: Lower bounds on the complexity of 1-time-only branching programs, Lecture Notes in Comput. Sci.,199(1985), pp.90–99.

    Google Scholar 

  4. M.Furst, J.B.Saxe and M.Sipser: Parity, circuits and polynomial-time hierarchy, 22ND Symp. on the Foundations of Computer Science, (1981), pp. 260–270.

    Google Scholar 

  5. S.V. Jablonskij: On algorithmic obstacles in synthesis of minimal contact schemes, Problemy Kibernetiki, 2 (1959), pp.75–121.

    Google Scholar 

  6. J.I. Janov: On some semantic characteristics of Turing machines, Dokl. Akad. Nauk SSSR, 224 (1975), pp.301–304.

    Google Scholar 

  7. S.P. Jukna: Convolutional characterization of computability and complexity of computations, Colloquia Mathematica Societatis János Bolyai, 44 (1984), pp. 251–270.

    Google Scholar 

  8. S.E. Kuznetsov: Combinatorial circuits with no null chains over basis {&, V, −}, Izvestija VUZ, Matematika, 5 (1981), pp. 56–63.

    Google Scholar 

  9. E.I. Nechiporuk: A Boolean function, Doklady Akad. Nauk SSSR, 169 (1966), pp. 765–766.

    Google Scholar 

  10. P.Pudlák and S.Žák: Space complexity of computations, Preprint Univ. Prague (1983), 30p.

    Google Scholar 

  11. A.K.Pulatov: Lower bounds on the complexity of implementation of characteristic functions of group codes by Π-networks, Combinatorial-Algebraic Methods in Applied Mathematics, Gorki (1979), pp. 81–95.

    Google Scholar 

  12. A.A. Razborov: Lower bounds on the monotone complexity of some Boolean functions, Doklady Akad. Nauk SSSR, 281 (1985), pp. 798–801.

    Google Scholar 

  13. G.A.Tkachev: On the complexity of a sequence of Boolean functions by implementing in terms of circuits and Π-circuits under additional restrictions on the circuits structure, Combinatorial-Algebraic Methods in Applied Mathematics, Gorki (1980), pp. 261–207.

    Google Scholar 

  14. I.Wegener: On the complexity of branching programs and decision trees for clique functions, Univ. Frankfurt, Interner Bericht, 5 (1984), 32p.

    Google Scholar 

  15. S. Žak: An exponential lower bounds for one-time-only branching programs, Lecture Notes in Computer Science, 176 (1984), pp. 562–566.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Cybernetics, Lithuanian Academy of Sciences, 232021, Vilnius, USSR

    S. P. Jukna

Authors
  1. S. P. Jukna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jukna, S.P. (1986). Lower bounds on the complexity of local circuits. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016269

Download citation

  • DOI: https://doi.org/10.1007/BFb0016269

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation