Skip to main content
SpringerLink
Log in

Average-Case Complexity of Partial Boolean Functions

  • Conference paper
Stochastic Algorithms: Foundations and Applications (SAGA 2003)

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

Included in the following conference series:

  • 489 Accesses

Abstract

The average-case complexity of partial Boolean functions is considered. For almost all functions it is shown that, up to a multiplicative constant, the average-case complexity does not depend on the size of the function’s domain but depends only on the number of tuples on which the function is equal to unity.

This work was supported by the Russian Foundation for Basic Research (project no. 02-01-00985) and the program of supporting scientific schools (project no. SSh-1807.2003.01).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreev, A.E.: On Circuit Complexity of Partial Boolean Functions. Diskret. Mat. 1(4), 36–45 (1989) (in Russian)

    Google Scholar 

  2. Sholomov, L.A.: On the Implementation of Partial Boolean Functions by Circuits. In: Problemy kibernetiki, vol. 21, pp. 215–226. Nauka, Moscow (1969) (in Russian)

    Google Scholar 

  3. Lupanov, O.B.: An Approach to the Synthesis of Control Systems – The Principle of Local Coding. In: Problemy kibernetiki, vol. 14, pp. 31–110. Nauka, Moscow (1965)

    Google Scholar 

  4. Chashkin, A.V.: Average Case Complexity for Finite Boolean Functions. Discrete Applied Mathematics 114, 43–59 (2001)

    Google Scholar 

  5. Chashkin, A.V.: Average Time of Computing Boolean Operators. Operations Research and Discrete Analysis, Ser. 1 5(1), 88–103 (1998) (in Russian)

    Google Scholar 

  6. Chashkin, A.V.: Computation of Boolean Functions by Randomized Programs. Operations Research and Discrete Analysis, Ser. 1 4(3), 49–68 (1997)

    MathSciNet  Google Scholar 

  7. Chashkin, A.V.: Average Time of Computing Boolean Operators. Discrete Math. and Appl. 1, 77–82 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia

    Alexander Chashkin

Authors
  1. Alexander Chashkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Science and Technology Research Institute, University of Hertfordshire, AL10 9AB, Hatfield, Herts, UK

    Andreas Albrecht

  2. Department of Computer Science, King’s College London, WC2R 2LS, London, UK

    Kathleen Steinhöfel

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chashkin, A. (2003). Average-Case Complexity of Partial Boolean Functions. In: Albrecht, A., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2003. Lecture Notes in Computer Science, vol 2827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39816-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39816-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39816-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation