Back to Results
First PageMeta Content
Complexity classes / True quantified Boolean formula / Alternating Turing machine / FO / DTIME / NTIME / Time complexity / SL / Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics


Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract
Add to Reading List

Document Date: 2008-04-30 19:50:48


Open Document

File Size: 155,18 KB

Share Result on Facebook
UPDATE