Advertisement

On Boolean decision trees with faulty nodes

  • Claire Kenyon
  • Valerie King
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 601)

Abstract

We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a fixed probabilty. We show that f can be represented in k — DNF form and in j — CNF form, then O(n log(min{j, k/q})) queries suffice to compute f with probability of error less than q. This work uses a new approach to extend results of Feige, Raghavan, Peleg and Upfal, who proved the same bound for a narrower class of functions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Uriel Feige, David Peleg, Prabhakar Raghavan and Eli Upfal. Computing with Noisy Information, 22nd Annual ACM Symposium on Theory of Computing, 1990, 128–137.Google Scholar
  2. 2.
    Uriel Feige, David Peleg, Prabhakar Raghavan and Eli Upfal. Computing with Noisy Information, unpublished manuscript (1991).Google Scholar
  3. 3.
    Claire Kenyon and Andrew C. Yao. On evaluating boolean functions with unreliable tests, International Journal of Foundations of Computer Science, 1, 1(1990), 1–10.Google Scholar
  4. 4.
    William Feller. An Introduction to Probability Theory and its Applications, Volume 1, Wiley and Sons 1957.Google Scholar
  5. 5.
    Anna Gal Lower Bounds for the Complexity for Reliable Boolean Circuits with Noisy Gates, FOCS '91.Google Scholar
  6. 6.
    N. Nisan CREW PRAMs and Decision Trees STOC '89.Google Scholar
  7. 7.
    N. Pippenger On Networks of Noisy Gates FOCS '85.Google Scholar
  8. 8.
    R. Reischuk and B. Schmeltz. Reliable Computation with Noisy Circuits and Decision Trees — A General n log n Lower Bound, FOCS '91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Claire Kenyon
    • 1
  • Valerie King
    • 2
  1. 1.LIP-IMAG, Ecole Normale Supérieure de LyonLyon Cedex 07France
  2. 2.NECIPrincetonUSA

Personalised recommendations