scispace - formally typeset
Open AccessJournal Article

An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP

Reads0
Chats0
TLDR
In this article, the authors discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.
Abstract
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.

read more

Citations
More filters
Posted Content

Introduction to twisted commutative algebras

TL;DR: The theory of twisted commutative algebras can be seen as a generalization of the theory of linear symmetries as mentioned in this paper, which can be thought of as a theory for handling large groups of symmetric groups.
Book

Partial Derivatives in Arithmetic Complexity and Beyond

TL;DR: The bulk of the survey shows that partial derivatives provide essential ingredients in proving both upper and lower bounds for computing polynomials by a variety of natural arithmetic models.
Journal ArticleDOI

On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna

TL;DR: An overview of the geometric complexity theory (GCT) approach towards the P vs. NP and related problems focusing on its main complexity theoretic results is given, consisting of positivity hypotheses in algebraic geometry and representation theory and easier hardness hypotheses.
Journal ArticleDOI

The GCT program toward the P vs. NP problem

TL;DR: Exploring the power and potential of geometric complexity theory with a focus on LaSalle's inequality.
Journal ArticleDOI

Even partitions in plethysms

TL;DR: For all natural numbers k, n, d with k ⩽ d and every partition λ of size kn with at most k parts there exists an irreducible GL d (C ) -representation of highest weight 2λ in the plethysm Sym k ( Sym 2 n C d ).
References
More filters
Journal ArticleDOI

A mathematical theory of communication

TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI

Lie Group Representations on Polynomial Rings

TL;DR: In this paper, a group of linear transformations on a finite dimensional real or complex vector space X is considered as a G-module, and S is the sub-ring of all G-invariant polynomials on X.
Proceedings ArticleDOI

Completeness classes in algebra

TL;DR: The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects (A) and (B).