Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem (0)
Cached
Download Links
- [ftp.cs.rutgers.edu]
- [athos.rutgers.edu]
- [www.cs.rutgers.edu]
- [www.cse.iitk.ac.in]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [ftp.cs.rutgers.edu]
- [dimacs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
by
Manindra Agrawal
,
Eric Allender
,
Steven Rudich
| Venue: | Journal of Computer and System Sciences |
| Citations: | 28 - 12 self |
BibTeX
@ARTICLE{Agrawal_reductionsin,
author = {Manindra Agrawal and Eric Allender and Steven Rudich},
title = {Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem},
journal = {Journal of Computer and System Sciences},
year = {},
volume = {57},
pages = {127--143}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that all sets that arecomplete for NP under non-uniform AC are isomorphic under non-uniform AC -computable isomorphisms. Furthermore, these sets remain NP-complete even under non-uniform NC reductions.
