English
Related papers

Related papers: P versus NP and geometry

200 papers

Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.

Computational Complexity · Computer Science 2009-08-19 Ketan D. Mulmuley

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…

Computational Complexity · Computer Science 2009-08-19 Ketan D. Mulmuley

I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.

Algebraic Geometry · Mathematics 2015-09-09 J. M. Landsberg

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle,…

Computational Complexity · Computer Science 2007-09-07 Ketan D. Mulmuley

We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…

Algebraic Geometry · Mathematics 2016-09-12 M. Umut Isik

This article is a 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…

Algebraic Geometry · Mathematics 2013-12-13 J. M. Landsberg

In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…

Discrete Mathematics · Computer Science 2016-03-03 Anatoly D. Plotnikov

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.…

Computational Complexity · Computer Science 2011-01-10 Peter Buergisser , J. M. Landsberg , Laurent Manivel , Jerzy Weyman

An attempt of a new kind of complexity anthropology is considered.

Other Computer Science · Computer Science 2009-04-21 Michael A. Popov

For every variety of algebras and every algebras in these variety we can consider an algebraic geometry. Algebras may be many sorted (not necessarily one sorted) algebras. A set of sorts is fixed for each variety. This theory can be applied…

Representation Theory · Mathematics 2007-05-23 B. Plotkin , A. Tsurkov

This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…

Computational Complexity · Computer Science 2010-06-14 Carlos Barron-Romero

In this paper, we present a unified approach using model category theory and an associative law to compare some classic variants of the geometric realization functor.

Algebraic Topology · Mathematics 2018-04-03 Yi-Sheng Wang

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Computational Complexity · Computer Science 2023-12-25 Rami Zaidan

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

Group Theory · Mathematics 2017-03-08 J. C. Birget

This is a brief overview of our work on the theory of group invariant solutions to differential equations. The motivations and applications of this work stem from problems in differential geometry and relativistic field theory. The key…

Mathematical Physics · Physics 2007-05-23 I. M. Anderson , M. E. Fels , C. G. Torre

We introduce geometric invariants for $p$-groups of class $2$ and exponent $p$. We report on their effectiveness in distinguishing among 5-generator $p$-groups of this type.

Group Theory · Mathematics 2026-03-26 E. A. O'Brien , Mima Stanojkovski

This exposition presents recent developments on proper actions, highlighting their connections to representation theory. It begins with geometric aspects, including criteria for the properness of homogeneous spaces in the setting of…

Representation Theory · Mathematics 2026-04-27 Toshiyuki Kobayashi

This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…

Computational Complexity · Computer Science 2009-01-22 Ketan D. Mulmuley

In this talk, I will survey recent progress made on the classification of von Neumann algebras arising from countable groups and their actions on probability spaces. In particular, I will present the first results which provide classes of…

Operator Algebras · Mathematics 2012-12-04 Adrian Ioana

In this paper, considering the geometric equivalence for algebras of a variety $_{S}A$ of S-acts over a monoid S, we obtain representation theorems describing all types of the equivalence classes of geometrically equivalent S-acts of…

Rings and Algebras · Mathematics 2011-06-29 Yefim Katsov
‹ Prev 1 2 3 10 Next ›