4 citations · 10 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018★ 2 cited
A theory of finite structures
Daniel Leivant
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for co…
cs.LO2018★ 3 cited
Implicit complexity via structure transformation
Daniel Leivant, Jean-Yves Marion
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and dedu…