activity
20162023
most citedGluing resource proof-structures: inhabitation and inverting the Taylor expansion

2 citations · 4 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2020

Lower bounds for algebraic machines, semantically

Luc Pellissier, Thomas Seiller

This paper presents a new semantic method for proving lower bounds in computational complexity. We use it to prove that maxflow, a PTIME complete problem, is not computable in poly…

cs.CC2018★ 2 cited

Unifying lower bounds for algebraic machines, semantically

Thomas Seiller, Luc Pellissier, Ulysse Léchine

This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it…