Skip to main content
Conference Proceedings

On the power of two-local random reductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 739 LNCS 346-351
DOI: 10.1007/3-540-57332-1_29
1Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that any language that has a two-locally-random reduction in which the target functions are boolean is in NP/poly∩co-NP/poly. This extends and simplifies a result by Yao.

Cite

CITATION STYLE

APA

Fortnow, L., & Szegedy, M. (1993). On the power of two-local random reductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 739 LNCS, pp. 346–351). Springer Verlag. https://doi.org/10.1007/3-540-57332-1_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free