The GCT program toward the P vs. NP problem

Authors:
Ketan D. Mulmuley
Affiliations:
University of Chicago, IL
Venue:
Communications of the ACM
Year:
2012

Citing 12
Cited 2

The complexity of finite functions

Handbook of theoretical computer science (vol. A)
Lower Bounds in a Parallel Model without Bit Operations

SIAM Journal on Computing
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems

SIAM Journal on Computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds

Computational Complexity
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties

SIAM Journal on Computing
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
The status of the P versus NP problem

Communications of the ACM - The Status of the P versus NP Problem
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna

Journal of the ACM (JACM)
Algebraic Complexity Theory

Algebraic Complexity Theory
Proving lower bounds via pseudo-random generators

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Geometric complexity theory III: on deciding nonvanishing of a Littlewood---Richardson coefficient

Journal of Algebraic Combinatorics: An International Journal

Inductive complexity of p versus NP problem

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Non-commutative arithmetic circuits with division

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	48.22

Visualization

Abstract

Exploring the power and potential of geometric complexity theory.