Skip to main content
SpringerLink
Log in

The complexity of symmetric functions in parity normal forms

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

  • 761 Accesses

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. Ajtai, M.: ∑ 11 -formulae on finite structures, Ann. Pure and Applied Logics 24(1983), 1–48

    Google Scholar 

  2. Brustmann, B., Wegener, I.: The complexity of symmetric functions in bounded depth circuits, Information Processing Letters 25(1987), 217–219

    Google Scholar 

  3. Diskrete Mathematik und mathematische Fragen der Kybernetik, ed. Burosch, G., Kiesewetter, H., Berlin 1980, 274–277

    Google Scholar 

  4. Damm,C.,Meinel,Ch.:Separating completely complexity classes related to polynomial size Ω-decision trees, Proc. FCT'89(Szeged), LNCS 380, 127–136

    Google Scholar 

  5. Denenberg, L.,Gurevich, Y.,Shelah, S.:Definability by constant-depth polynomial-size circuits, Information and control 70(1986), 216–240

    Google Scholar 

  6. Fagin, R.,Klawe, M.,Pippenger, N.,Stockmeyer, L.: Bounded depth, polynomial size circuits for symmetric functions, Theoretical Computer Science 36(1985), 239–250

    Google Scholar 

  7. Furst,M.,Saxe,J.,Sipser,M.:Parity, circuits and the polynomial time hierarchy, Proc. 22nd IEEE FOCS (1981), 260–270

    Google Scholar 

  8. Håstad,J.:Almost optimal lower bounds for small depth circuits. Proc. 18th ACM STOC (1986), 6–20

    Google Scholar 

  9. Razborov, A.:Lower bounds on the size of bounded depth circuits over the basis {Λ,⊕}, preprint Steklov Inst. for Math., Moscow 1986 (see also Mat. Zam. 41(1987), 598–607)(in Russian)

    Google Scholar 

  10. Yao, A.C.: Separating the polynomial time hierarchy by oracles Proc. 26th IEEE FOCS (1985), 1–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universität zu Berlin, PO Box 1297, DDR-1086, Berlin

    Carsten Damm

Authors
  1. Carsten Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, C. (1990). The complexity of symmetric functions in parity normal forms. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029613

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation