A Casual Tour Around a Circuit Complexity Bound

Details A Casual Tour Around a Circuit Complexity Bound A Casual Tour Around a Circuit Complexity Bound

2011-11-04

arxiv.org/abs/1111.1261v1

Computer Science

Computational Complexity

21 pages, 2 figures. An earlier version appeared in SIGACT News, September 2011

Scientific paper

I will discuss the recent proof that the complexity class NEXP
(nondeterministic exponential time) lacks nonuniform ACC circuits of polynomial
size. The proof will be described from the perspective of someone trying to
discover it.

Affiliated with

Also associated with

No associations

Rating

A Casual Tour Around a Circuit Complexity Bound 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 Casual Tour Around a Circuit Complexity Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Casual Tour Around a Circuit Complexity Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65079