Back to Results
First PageMeta Content
Complexity classes / Advice / P/poly / Padding argument / Bounded-error probabilistic polynomial / Polynomial hierarchy / Circuit complexity / PP / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2008-07-31 09:53:05

Open Document

File Size: 146,25 KB

Share Result on Facebook

City

Washington / DC / London / New York / /

Company

SIAM Journal / ACM Press / /

Country

United Kingdom / United States / /

/

Facility

Engineering University of Nebraska Lincoln / /

IndustryTerm

machine computing b1 b2 / computing / machine computing / /

Organization

Computer Science & Engineering University of Nebraska Lincoln / Exponential Hierarchy Chris Bourke Department of Computer Science / National Science Foundation / IEEE Computer Society / /

Person

Avi Wigderson / Osamu Watanabe / Steven Homer / John Hitchcock / Valentine Kabanets / Harry Buhrman / Richard M. Karp / Richard J. Lipton / Jin-Yi Cai / Russell Impagliazzo / Mark W. Krentel / N. V. Vinodchandran / Christopher B. Wilson / /

ProgrammingLanguage

DC / /

ProvinceOrState

Nebraska / New York / Massachusetts / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / /

Technology

end end Algorithm / /

SocialTag