Learn More
Ramified recurrence over free algebras has been used over the last two decades to provide machineindependent characterizations of major complexity classes. We consider here ramification for the dual setting, referring to coinductive data and corecurrence rather than inductive data and recurrence. Whereas ramified recurrence is related basically to feasible(More)
A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size. The relevant notion of input size is often specific to a datatype, with measures including the length of a list, the maximum element in a list, and the height of a tree. In this(More)
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider here the provability of functions over coinductive data in a highly expressive, yet proof-theoretically weak, variant of second order logic L ∗ , which we believe captures the notion(More)
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 seamless combination of computation and reasoning, and using productivity (fairness) as the fundamental assertion, rather than bi-simulation. The latter is expressible in terms of(More)
The vast power of iterated recurrence is tamed by data ramification: if a function over words is definable by ramified recurrence and composition, then it is feasible, i.e. computable in polynomial time, i.e. any computation using the first n input symbols can have at most p(n) distinct configurations, for some polynomial p. Here we prove a dual result for(More)
Computational criminology is an emerging interdisciplinary field that applies computer science and mathematical methods to the study of criminological problems. In order to understand the nature of crime one has to comprehend not only its spatio-temporal dimensions, but also the victim-offender relationship, role of guardians and history of similar(More)
  • Dr M Elumalai, Dr D Bhuminathan, Ramyaa
  • 2014
Oral precancerous lesions are one of the most common lesions present worldwide today. They are usually neglected by the common population when compared to cancerous lesion. However, they also may be extremely fatal which changes as cancer if left untreated at a very initial stage of the lesion. Early detection and treatment gives the best chance for its(More)
The Immerman-Szelepcsenyi Theorem uses an algorithm for co-stconnectivity based on inductive counting to prove that NLOGSPACE is closed under complementation. We want to investigate whether counting is necessary for this theorem to hold. Concretely, we show that Nondeterministic Jumping Graph Autmata (ND-JAGs) (pebble automata on graphs), on several(More)
AIM The aim was to analyze general incidence, age incidence, laterality, common mode of presentation, staging of the tumor, radiological evidence, histopathological confirmation, management and follow-up of cases, which were diagnosed as retinoblastoma. DESIGN Interventional case series study from April 1997 to March 2000. MATERIALS AND METHODS Detailed(More)