A variation on the zero-one law

https://doi.org/10.1016/S0020-0190(98)00078-7Get rights and content

Abstract

Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there is a polynomial time algorithm that solves all instances xn of P? The answer is: zero or one.

References (1)

  • W. Feller

    An Introduction to Probability Theory and Its Applications

    (1968)

Cited by (0)

1

Partially supported by NSF grant DMS-9505118.

2

Partially supported by NSF grant CCR 95–04375 and ONR grant N00014-94-1-1137.

3

Partially supported by NASA grant NCCW-0089, NSF grants DUE-9750858 and EEC-9322370, and AFOSR grant F49620-95-1-0518.

View full text