Skip to main content
SpringerLink
Log in

On linear decision trees computing Boolean functions

  • Complexity And Computational Geometry (Session 17)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

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

Included in the following conference series:

Abstract

An Ω(n) lower bound is proved for the complexity of computing the inner product mod 2 of two n-bit vectors by linear decision trees, even if randomization and any fixed error probability ε<1/2 is allowed.

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

  • A. Aggarwal, D. Coppersmith, D. Kleitman (1989): A generalized model for understanding evasiveness, Inf. Proc. Lett.30, 205–208.

    Google Scholar 

  • L. Babai, P. Frankl, J. Simon (1986): Complexity classes in communication complexity, 27.FOCS, 337–347.

    Google Scholar 

  • L. Babai, N. Nisan, M. Szegedy (1989): Multiparty protocols and logspace hard pseudorandom sequences, 21.STOC, 1–11.

    Google Scholar 

  • D. A. Barrington (1989): Bounded-width polynomial size branching programs recognize exactly those languages in NC1, JCSS38, 150–164.

    Google Scholar 

  • B. Bollobás (1984): Extremal Graph Theory, Academic Press.

    Google Scholar 

  • L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone (1984): Classification and regression trees, Wadsworth.

    Google Scholar 

  • J. Bruck (1990): Harmonic analysis of polynomial threshold functions, SIAM J. Disc. Math.3, 168–177.

    Google Scholar 

  • B. Chor, O. Goldreich (1985): Unbiased bits from sources of weak randomness and probabilistic communication complexity, 26.FOCS, 429–442.

    Google Scholar 

  • M. Dietzfelbinger (1987), unpublished.

    Google Scholar 

  • M. Dietzfelbinger, W. Maass (1988): Lower bound arguments with “inaccessible” numbers, JCSS36, 313–335.

    Google Scholar 

  • D.P. Dobkin, R.J. Lipton (1978): A lower bound of n2/2 on linear search programs for the knapsack problem, JCSS16, 413–417.

    Google Scholar 

  • D.P. Dobkin, R.J. Lipton (1979): On the complexity of computations under varying sets of primitives, JCSS18, 86–91.

    Google Scholar 

  • H.D. Gröger (1988), unpublished.

    Google Scholar 

  • H.D. Gröger (1989): On the randomized complexity of monotone graph properties, submitted.

    Google Scholar 

  • H.D. Gröger, Gy. Turán (1990): A linear lower bound for the size of threshold circuits, submitted.

    Google Scholar 

  • A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, Gy. Turán (1987): Threshold circuits of bounded depth, 28.FOCS, 99–110.

    Google Scholar 

  • A. Hajnal, W. Maass, Gy. Turán (1988): On the communication complexity of graph properties, 20.STOC, 186–191.

    Google Scholar 

  • P. Hajnal (1988): The complexity of graph problems, Ph.D. Thesis, University of Chicago, TR 88–13.

    Google Scholar 

  • J. Kahn, M. Saks, D. Sturtevant (1984): A topological approach to evasiveness, Combinatorica4, 297–306.

    Google Scholar 

  • V. King (1988): Lower bounds on the complexity of graph properties, 20.STOC, 468–476.

    Google Scholar 

  • P. Klein, F. Meyer auf der Heide (1983): A lower time bound for the knapsack problem on random access machines, Acta Inf.19, 385–395.

    Google Scholar 

  • U. Manber, M. Tompa (1985): The complexity of problems on probabilistic, nondeterministic and alternating decision trees, JACM31, 720–732.

    Google Scholar 

  • F. Meyer auf der Heide (1984): A polynomial linear search algorithm for the n-dimensional knapsack problem, JACM31, 668–676.

    Google Scholar 

  • F. Meyer auf der Heide (1985a): Lower bounds for solving linear diophantine equations on random access machines, JACM32, 929–937.

    Google Scholar 

  • F. Meyer auf der Heide (1985b): Simulating probabilistic by deterministic algebraic computation trees, TCS41, 325–330.

    Google Scholar 

  • F. Meyer auf der Heide (1985c): Nondeterministic versus probabilistic linear search algorithms, 26.FOCS, 65–73.

    Google Scholar 

  • N. Nisan: CREW PRAMs and decision trees (1989), 21.STOC, 327–335.

    Google Scholar 

  • P. Pudlák (1986), personal communication.

    Google Scholar 

  • J.R. Quinlan (1986): Induction of decision trees, Machine Learning1, 81–106.

    Google Scholar 

  • D.E. Rumelhart, J.L. McClelland (1986): Parallel distributed processing: explorations in the microstructure of cognition, MIT Press.

    Google Scholar 

  • M. Saks, A. Wigderson (1986): Probabilistic Boolean decision trees and the complexity of evaluating game trees, 27.FOCS, 29–38.

    Google Scholar 

  • M. Snir: Proving lower bounds for linear decision trees (1981), 8.ICALP, LNCS115, 305–315.

    Google Scholar 

  • M. Snir: Comparisons between linear functions can help (1982), TCS19, 321–330.

    Google Scholar 

  • M. Snir (1985): Lower bounds on probabilistic linear decision trees, TCS38, 69–82.

    Google Scholar 

  • T.G. Tarján (1975): Complexity of lattice-configurations, Studia Sci. Math. Hung.10, 203–211.

    Google Scholar 

  • A.C. Yao (1975): On the complexity of comparison problems using linear functions, 16.FOCS, 85–89.

    Google Scholar 

  • A.C. Yao (1977): Probabilistic computations: toward a unified measure of complexity, 18.FOCS, 222–227.

    Google Scholar 

  • A.C. Yao (1982): On the time-space tradeoff for sorting with linear queries, TCS19, 203–218.

    Google Scholar 

  • A.C. Yao (1987): Lower bounds to randomized algorithms for graph properties, 28.FOCS, 393–400.

    Google Scholar 

  • A.C. Yao, R. Rivest (1980): On the polyhedral decision problem, SIAM J. Comp.9, 343–347.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Computer Sciences, Attila József University, Szeged

    Hans Dietmar Gröger

  2. Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago

    György Turán

  3. Automata Theory Research Group of the Hungarian Academy of Sciences, Szeged

    György Turán

Authors
  1. Hans Dietmar Gröger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Turán
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gröger, H.D., Turán, G. (1991). On linear decision trees computing Boolean functions. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_176

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_176

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation