The Permanent Requires Large Uniform Threshold Circuits (1999)
Cached
Download Links
- [cjtcs.cs.uchicago.edu]
- [ftp.cs.rutgers.edu]
- [athos.rutgers.edu]
- [www.cs.rutgers.edu]
- [ftp.cs.rutgers.edu]
- [dimacs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
by
Eric Allender
| Citations: | 24 - 9 self |
BibTeX
@MISC{Allender99thepermanent,
author = {Eric Allender},
title = {The Permanent Requires Large Uniform Threshold Circuits},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that the permanent cannot be computed by uniform constant-depth threshold circuits of size T (n) for any function T such that for all k, T (k) (n) = o(2 n ). More generally, we show that any problem that is hard for the complexity class C=P requires circuits of this size (on the uniform constant-depth threshold circuit model). In particular, this lower bound applies to any problem that is hard for the complexity classes PP or #P.
