Sciweavers

84
Voted
WOLLIC
2010
Springer
15 years 1 months ago
Feasible Functions over Co-inductive Data
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
Ramyaa Ramyaa, Daniel Leivant