## Amplifying lower bounds by means of self-reducibility (2008)

### Cached

### Download Links

- [www.math.cas.cz]
- [www.cz.math.cas.cz]
- [www.math.cas.cz]
- [athos.rutgers.edu]
- [www.cs.rutgers.edu]
- [ftp.cs.rutgers.edu]
- [ftp.cs.rutgers.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In IEEE Conference on Computational Complexity |

Citations: | 13 - 4 self |

### BibTeX

@INPROCEEDINGS{Allender08amplifyinglower,

author = {Eric Allender},

title = {Amplifying lower bounds by means of self-reducibility},

booktitle = {In IEEE Conference on Computational Complexity},

year = {2008}

}

### OpenURL

### Abstract

We observe that many important computational problems in NC 1 share a simple self-reducibility property. We then show that, for any problem A having this self-reducibility property, A has polynomial size TC 0 circuits if and only if it has TC 0 circuits of size n 1+ɛ for every ɛ>0 (counting the number of wires in a circuit as the size of the circuit). As an example of what this observation yields, consider the Boolean Formula Evaluation problem (BFE), which is complete for NC 1 and has the self-reducibility property. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE requires depth d TC 0 circuits of size n 1+ɛd. If one were able to improve this lower bound to show that there is some constant ɛ>0 such that every TC 0 circuit family recognizing BFE has size n 1+ɛ, then it would follow that TC 0 ̸ = NC 1. We show that proving lower bounds of the form n 1+ɛ is not ruled out by the Natural Proof framework of Razborov and Rudich and hence there is currently no known barrier for separating classes such as ACC 0,TC 0 and NC 1 via existing “natural ” approaches to proving circuit lower bounds. We also show that problems with small uniform constant-depth circuits have algorithms that simultaneously have small space and time bounds. We then make use of known time-space tradeoff lower bounds to show that SAT requires uniform depth d TC 0 and AC 0 [6] circuits of size n 1+c for some constant c depending on d. 1