22 citations · 69 across the 23 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 22 cited
Characterizing co-NL by a group action
Clément Aubert, Thomas Seiller
In a recent paper, Girard proposes to use his recent construction of a geometry of interaction in the hyperfinite factor in an innovative way to characterize complexity classes. We…
cs.CC2012★ 5 cited
Sublogarithmic uniform Boolean proof nets
Clément Aubert
Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et.…