2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LO2015
An in-between "implicit" and "explicit" complexity: Automata
Clément Aubert
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than…
cs.LO2015★ 2 cited
Memoization for Unary Logic Programming: Characterizing PTIME
Clément Aubert, Marc Bagnol, Thomas Seiller
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic pr…