Back to Results
First PageMeta Content
Complexity classes / NTIME / Circuit complexity / P / Bounded-error probabilistic polynomial / Cook–Levin theorem / Time hierarchy theorem / NEXPTIME / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†
Add to Reading List

Document Date: 2011-11-07 20:15:16

Open Document

File Size: 193,04 KB

Share Result on Facebook
UPDATE