2-Local Random Reductions to 3-Valued Functions

Authors:
A. Pavan;N. V. Vinodchandran
Affiliations:
Iowa State University, Department of Computer Science, 50011, Ames, IA, USA;University of Nebraska-Lincoln, Department of Computer Science and Engineering, 68588, Lincoln, NE, USA
Venue:
Computational Complexity
Year:
2008

Citing 0
Cited 1

Complexity upper bounds for classical locally random reductions using a quantum computational argument

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Yao (in a lecture at DIMACS Workshop on structural complexity and cryptography, 1990) showed that if a language L is 2-locally random reducible to a Boolean function, then L ∈ PSPACE/poly. Fortnow & Szegedy quantitatively improved Yao’s result to show that such languages are in fact in NP/poly (Information Processing Letters, 1992). In this paper we extend Yao’s result to show that if a language L is 2-locally random reducible to a target function which takes values in {0, 1, 2}, then L ∈ PSPACE/poly.