Computer Science – Computational Complexity
Scientific paper
2010-12-02
Computer Science
Computational Complexity
Scientific paper
We note that for each k \in {0,1,2, ...} the following holds: NE has
(nonuniform) ACC^k circuits if and only if NE has P^{NE}-uniform ACC^k
circuits. And we mention how to get analogous results for other circuit and
complexity classes.
No associations
LandOfFree
A Note on Nonuniform versus Uniform ACC^k Circuits for NE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Nonuniform versus Uniform ACC^k Circuits for NE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Nonuniform versus Uniform ACC^k Circuits for NE will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512909