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

City

San Francisco / /

Company

SIAM Journal / CNF / /

/

IndustryTerm

deterministic algorithms / linear time algorithm / deterministic algorithm / time efficient algorithms / faster alternating algorithms / /

Organization

Carnegie Mellon University / /

Person

Van Melkebeek-Raz / Van Melkebeek / /

Position

author / tape head / ith head / /

ProgrammingLanguage

L / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / Theoretical Computer Science / Theory of Computing / /

Technology

RAM / alternating algorithm / alternating time algorithm / faster alternating algorithms / deterministic algorithm / ATM / linear time algorithm / random access / simulation / QBF algorithm / /

SocialTag