Skip to main content
SpringerLink
Log in

Non-intersecting Complexity

  • Conference paper
Book cover SOFSEM 2006: Theory and Practice of Computer Science (SOFSEM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3831))

Abstract

A new complexity measure for Boolean functions is introduced in this article. It has a link to the query algorithms: it stands between both polynomial degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered.

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. Belovs, A.: A Way of constructing Functions with a Low Polynomial Degree. Scientific papers University of Latvia 673, 13–17 (2004)

    Google Scholar 

  2. Burhman, H., de Wolf, R.: Complexity Measures and Decision Tree Complexity: a Survey. Theoretical Computer Science 288, 21–43 (2001)

    Article  Google Scholar 

  3. Gruska, J.: Quantum Computing, p. 439. McGraw Hill, London (1999)

    Google Scholar 

  4. Midrijānis, G.: On Randomized and Quantum Query Complexities, Unpublished http://arxiv.org/abs/quant-ph/0501142

  5. Minsky, M., Papert, S.: Perceptrons. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  6. Nisan, N., Wigderson, A.: On Rank vs. Communication Complexity. Combinatorica 15, 557–565 (1995)

    MATH  MathSciNet  Google Scholar 

  7. Papadimitriou, C.: Computational Complexity, p. 500. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Latvia, Raiņa bulvāris 29, LV-1459, Rīga, Latvia

    Aleksandrs Belovs

Authors
  1. Aleksandrs Belovs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague 8, Czech Republic

    Jiří Wiedermann  & Július Štuller  & 

  2. Department of Information and Computer Sciences, University of Utrecht, P.O. Box 80.089, 3508, Utrecht, TB, The Netherlands

    Gerard Tel

  3. Faculty of Mathematics and Physics, Charles University, Prague

    Jaroslav Pokorný

  4. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava

    Mária Bieliková

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Belovs, A. (2006). Non-intersecting Complexity. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_13

Download citation

  • DOI: https://doi.org/10.1007/11611257_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31198-0

  • Online ISBN: 978-3-540-32217-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation