Add to ORKGAbstract This article is survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called geometric complexity theory (GCT). It is written to be accessible to graduate students. Numerous open questions in alge-braic geometry and representation theory relevant for GCT are presented
Abstract: Algebraic way to define complexity is the key point of this article. You find he...
Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s....
Abstract Recently it has been shown that the complexity of SU(n) operator is determined by the geode...
AbstractIn this primarily expository article, I describe geometric approaches to variants of P versu...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
The complexity of a number of fundamental problems in computational geometry is examined and a numbe...
International audienceWe discuss the geometry of orbit closures and the asymptotic behavior of Krone...
Complexity theory deals with determining when there does or does not exist a faster algorithm than t...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
In this lecture I introduce two problems in complexity: determining the complexity of matrix multipl...
Abstract. We show that most arithmetic circuit lower bounds and relations between lower bounds natur...
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity...
Abstract: Algebraic way to define complexity is the key point of this article. You find he...
Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s....
Abstract Recently it has been shown that the complexity of SU(n) operator is determined by the geode...
AbstractIn this primarily expository article, I describe geometric approaches to variants of P versu...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
The complexity of a number of fundamental problems in computational geometry is examined and a numbe...
International audienceWe discuss the geometry of orbit closures and the asymptotic behavior of Krone...
Complexity theory deals with determining when there does or does not exist a faster algorithm than t...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
In this lecture I introduce two problems in complexity: determining the complexity of matrix multipl...
Abstract. We show that most arithmetic circuit lower bounds and relations between lower bounds natur...
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity...
Abstract: Algebraic way to define complexity is the key point of this article. You find he...
Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s....
Abstract Recently it has been shown that the complexity of SU(n) operator is determined by the geode...