Sciweavers

APPROX
2015
Springer

Tighter Connections between Derandomization and Circuit Lower Bounds

8 years 7 months ago
Tighter Connections between Derandomization and Circuit Lower Bounds
We tighten the connections between circuit lower bounds and derandomization for each of the following three types of derandomization: general derandomization of promise-BPP (connected to Boolean circuits), derandomization of Polynomial Identity Testing (PIT) over fixed finite fields (connected to arithmetic circuit lower bounds over the same field), and derandomization of PIT over the integers (connected to arithmetic circuit lower bounds over the integers). We show how to make these connections uniform equivalences, although at the expense of using somewhat less common versions of complexity classes and for a less studied notion of inclusion. Our main results are as follows:
Marco Carmosino, Russell Impagliazzo, Valentine Ka
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where APPROX
Authors Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
Comments (0)