A variation on the zero-one law

DOI10.1016/S0020-0190(98)00078-7zbMATH Open1339.68108OpenAlexW1995193071MaRDI QIDQ293304FDOQ293304

Authors: Andreas Blass, Yuri Gurevich, Luc Longpré, Vladik Kreinovich 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000787?np=y

Recommendations

• The zero-one law holds for BPP
• When Does the Zero-One Law Hold?
• An observation on probability versus randomness with applications to complexity classes
• A stronger Kolmogorov zero-one law for resource-bounded measure
• Zero-one laws for modal logic

zbMATH Keywords

computational complexityzero-one lawpolynomial-time solvability

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Title not available (Why is that?)

Cited In (3)

• Promise problems on probability distributions
• When Does the Zero-One Law Hold?
• Title not available (Why is that?)

This page was built for publication: A variation on the zero-one law

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293304)