Geometric complexity theory and matrix powering
نویسندگان
چکیده
منابع مشابه
Geometric complexity theory and matrix powering
Valiant’s famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related problems via algebraic geometry and representation theory. Their approach works by multiplying the permanent polynomial with a high power of a linear form (a proc...
متن کاملGeometric Complexity Theory: Introduction
Foreword These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author in the spring quarter, 2007. It gives introduction to the basic structure of GCT. Part II consists of the lecture notes for the course given by the...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملGeometric Complexity Theory: an introduction for geometers
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 algebraic geometry and representation theory relevant for GCT are presented.
متن کاملLecture 1 : Geometric Complexity Theory Overview
In this exposition, we give a overview of the GCT approach to solve fundamental lower bound problems in algebraic models of computation. 1.1 Lower bound problems Consider a polynomial f(~x) ∈ Z[~x] with integral coefficients. The non-uniform version of the P v/s NP problem, prescribes a specific such f and asks if it can be shown not to have polynomial size arithmetic circuits over F2. The char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Differential Geometry and its Applications
سال: 2017
ISSN: 0926-2245
DOI: 10.1016/j.difgeo.2017.07.001