Skip to main content
SpringerLink
Log in

Random boolean formulas representing any boolean function with asymptotically equal probability

(extended abstract)

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

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

  • 146 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. Boppana, R.B.: Amplification of Probabilistic Boolean Formulas, Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 20–29.

    Google Scholar 

  2. Razborov, A.A.: Formulas of Bounded Depth in Basis { &,⊕ } and some Combinatorial Problems (Russian), to appear in Složnosť algoritmov i prikladnaja matěmatičeskaja logika, S.I.Adjan editor

    Google Scholar 

  3. Savický, P.: Boolean Functions Represented by Random Formulas, announcement, Commentationes Mathematicea Universitatis Carolinae, 28,2,1987

    Google Scholar 

  4. Savický, P.: Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability, TR Dept. of Comp. Science, Charles Univ., Prague, 1987, to appear in Discrete Mathematics

    Google Scholar 

  5. Valiant, L.G.: Short Monotone Formulae for the Majority Function. Journal of Algorithms 5,pp.363–366,1984

    Google Scholar 

  6. Wegener, I.: The Complexity of Boolean Functions, Stuttgart:B.G. Teubner/New York:Wiley 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, Praha 1, Czechoslovakia

    Petr Savický

Authors
  1. Petr Savický
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Savický, P. (1988). Random boolean formulas representing any boolean function with asymptotically equal probability. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017174

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation