AbstractIn this primarily expository article, I describe geometric approaches to variants of P versus NP, present several results that illustrate the role of group actions in complexity theory, and make a first step towards geometric definitions of complexity classes. My goal is to help bring geometry and complexity theory closer together
AbstractThis paper discusses the scope and goals of structural complexity theory, describes some wor...
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing...
problem. While many may have heard of the P vs. NP problem in computational science through pop cult...
AbstractIn this primarily expository article, I describe geometric approaches to variants of P versu...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
Abstract This article is survey of recent developments in, and a tutorial on, the approach to P v. N...
Complexity theory deals with determining when there does or does not exist a faster algorithm than t...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
International audienceWe discuss the geometry of orbit closures and the asymptotic behavior of Krone...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
Understanding the difference between group orbits and their closures is a key difficulty in geometri...
In [K. D. Mulmuley and M. Sohoni, SIAM J. Comput., 31 (2001), pp. 496 - 526], henceforth referred to...
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity...
AbstractThis paper discusses the scope and goals of structural complexity theory, describes some wor...
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing...
problem. While many may have heard of the P vs. NP problem in computational science through pop cult...
AbstractIn this primarily expository article, I describe geometric approaches to variants of P versu...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
Abstract This article is survey of recent developments in, and a tutorial on, the approach to P v. N...
Complexity theory deals with determining when there does or does not exist a faster algorithm than t...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
International audienceWe discuss the geometry of orbit closures and the asymptotic behavior of Krone...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
Understanding the difference between group orbits and their closures is a key difficulty in geometri...
In [K. D. Mulmuley and M. Sohoni, SIAM J. Comput., 31 (2001), pp. 496 - 526], henceforth referred to...
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity...
AbstractThis paper discusses the scope and goals of structural complexity theory, describes some wor...
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing...
problem. While many may have heard of the P vs. NP problem in computational science through pop cult...
DOI
Add to ORKG