DeepAI AI Chat
Log In Sign Up

PRAMs over integers do not compute maxflow efficiently

by   Luc Pellissier, et al.
Université Paris 13

Finding lower bounds in complexity theory has proven to be an extremely difficult task. In this article, we analyze two proofs of complexity lower bound: Ben-Or's proof of minimal height of algebraic computational trees deciding certain problems and Mulmuley's proof that restricted Parallel Random Access Machines (prams) over integers can not decide P-complete problems efficiently. We present the aforementioned models of computation in a framework inspired by dynamical systems and models of linear logic : graphings. This interpretation allows to connect the classical proofs to topological entropy, an invariant of these systems; to devise an algebraic formulation of parallelism of computational models; and finally to strengthen Mulmuley's result by separating the geometrical insights of the proof from the ones related to the computation and blending these with Ben-Or's proof. Looking forward, the interpretation of algebraic complexity theory as dynamical system might shed a new light on research programs such as Geometric Complexity Theory.


Lower bounds for prams over Z

This paper presents a new abstract method for proving lower bounds in co...

Clones, polymorphisms and relations of arity omega

Polymorphisms of arity omega have recently been used in the proof of mod...

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

We introduce the binary value principle which is a simple subset-sum ins...

Tradeoffs for small-depth Frege proofs

We study the complexity of small-depth Frege proofs and give the first t...

Proofs, Circuits, and Communication

We survey lower-bound results in complexity theory that have been obtain...

Yet another argument in favour of NP=CoNP

This article shows yet another proof of NP=CoNP. In a previous article, ...

The Cook-Reckhow definition

The Cook-Reckhow 1979 paper defined the area of research we now call Pro...