Reductions to the set of random strings: The resource-bounded case

This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings. In this paper we show that an approach laid out in [Allender et al] to settle this conjecture cannot succeed without significant alteratio...

Full description

Bibliographic Details

Published in:	Logical Methods in Computer Science
Main Authors:	Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2014-08-01
Subjects:	computer science - computational complexity computer science - logic in computer science
Online Access:	https://lmcs.episciences.org/723/pdf