A Variation on the Zero-One Law

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.

• Type: Journal
• Year: 1998
• Where: IPL
• Authors: Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
• Keywords: Binary Strings, Decision Problem, IPL 1998, Probability Distribution