Proving that prBPP = prP is as hard as proving that “almost NP” is not contained in P/poly

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Roei Tell

Journal title: Information Processing Letters

Journal number: 152

Journal publisher: Elsevier BV

Published year: 2019

Published pages: 105841

DOI identifier: 10.1016/j.ipl.2019.105841

ISSN: 0020-0190