Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Mulmuley, Ketan - Department of Computer Science, University of Chicago
On P vs. NP and Geometric Complexity Theory Dedicated to Sri Ramakrishna
On P vs. NP and Geometric Complexity Theory Dedicated to Sri Ramakrishna
Geometric Complexity Theory VI: The flip via positivity Dedicated to Sri Ramakrishna
Geometric Complexity Theory VI: The flip via positivity Dedicated to Sri Ramakrishna
Geometric Complexity Theory: Introduction Dedicated to Sri Ramakrishna
Geometric Complexity Theory IV: quantum group for the Kronecker problem
arXiv:cs.CC/0612134v1 Geometric Complexity Theory II
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
Lower bounds in a parallel model without bit operations 1
Geometric Complexity Theory I: An approach to the P vs. NP and related problems
Geometric complexity theory, P vs. NP, and explicit obstructions
Explicit Proofs and The Flip Dedicated to Sri Ramakrishna
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis
Geometric Complexity Theory V: On deciding nonvanishing of a generalized
On P vs. NP, Geometric Complexity Theory, and The Flip I: a highlevel view
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups