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

DOI10.1007/978-3-642-32589-2_11MaRDI QIDQ6828922zbMATH OpenFDO

Authors Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://dare.uva.nl/personal/pure/en/publications/reductions-to-the-set-of-random-strings(52e8b47c-2ffb-4fc7-9d11-c13b9299062c).html

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

This page was built for publication: Reductions to the set of random strings: the resource-bounded case

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