10 citations · 17 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013
Power of Nondetreministic JAGs on Cayley graphs
Martin Hofmann, Ramyaa Ramyaa
The Immerman-Szelepcsenyi Theorem uses an algorithm for co-st- connectivity based on inductive counting to prove that NLOGSPACE is closed un- der complementation. We want to invest…
cs.CC2012★ 4 cited
Implicit complexity for coinductive data: a characterization of corecurrence
Daniel Leivant, Ramyaa Ramyaa
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a…