Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Natural proof / Time complexity / P / L / Theorem / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics


On P vs. NP and Geometric Complexity Theory Dedicated to Sri Ramakrishna Ketan D. Mulmuley ∗ The University of Chicago (Appears in JACM, vol. 58, issue 2, April[removed]April 20, 2011
Add to Reading List

Document Date: 2011-04-20 13:55:53

Open Document

File Size: 314,75 KB

Share Result on Facebook

Facility

The University of Chicago / /

IndustryTerm

obvious algorithm / probabilistic polynomial time algorithm / /

Organization

National Science Foundation / The University of Chicago / /

Person

Janos Simon / Josh Grochow / Ketan D. Mulmuley / /

Position

author / /

Technology

Encryption / probabilistic polynomial time algorithm / co-RP algorithm / polynomial size encryption / decoding algorithm / obvious algorithm / /

SocialTag