Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LOCAL RANDOM REDUCTIONS:
Reports tagged with local random reductions:
TR05-062 | 17th June 2005
A. Pavan, Vinodchandran Variyam

2-Local Random Reductions to 3-Valued Functions

Yao (in a lecture at DIMACS Workshop on structural complexity and
cryptography) showed that if a language L is 2-locally-random
reducible to a Boolean functio, then L is in PSPACE/poly.
Fortnow and Szegedy quantitatively improved Yao's result to show that
such languages are in fact in NP/poly (Information Processing Letters, ... more >>>




ISSN 1433-8092 | Imprint