A Variation on the Zero-One Law

13 years 4 months ago

Download research.microsoft.com

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.

Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L

Real-time Traffic

Binary Strings | Decision Problem | IPL 1998 | Probability Distribution |

claim paper

» A New ZeroOne Law and Strong Extension Axioms

» ZeroOne Frequency Laws

» Program Schemes Queues the Recursive Spectrum and ZeroOne Laws

» Hereditary ZeroOne Laws for Graphs

» A Genuinely High Order Total Variation Diminishing Scheme for OneDimensional Scalar Conser...

» On the Total Variation of HighOrder SemiDiscrete Central Schemes for Conservation Laws

» Statistical Aspects in Variational Principles with Heat Flow

» On Distinguishing between Internet Power Law Topology Generators

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	IPL
Authors	Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré

Comments (0)

Sciweavers

A Variation on the Zero-One Law

Binary Strings | Decision Problem | IPL 1998 | Probability Distribution |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers