Results 251 to 260 of about 31,249 (277)
Some of the next articles are maybe not open access.
2005
My purpose in this lecture is to explain how the representation of algorithms by recursive programs can be used in complexity theory, especially in the derivation of lower bounds for worst-case time complexity, which apply to all—or, at least, a very large class of—algorithms.
openaire +2 more sources
My purpose in this lecture is to explain how the representation of algorithms by recursive programs can be used in complexity theory, especially in the derivation of lower bounds for worst-case time complexity, which apply to all—or, at least, a very large class of—algorithms.
openaire +2 more sources
Recursivity, sequence recursivity, stack recursivity and semantics of programs
1976Giorgio Germano +1 more
openaire +2 more sources
Recursive and Recursively Enumerable Sets
1987In the previous chapters we have studied computable functions f: ℕk → N and f: (W(Σ))k→W(Σ). The concept of computability is now used to define recursiveness and recursive enumerability of subsets A ⊆ ℕk and B ⊆ (W(Σ))k.
openaire +1 more source
A Recursion Formula for Resistance Distances and Its Applications
Discrete Applied Mathematics, 2013Yujun Yang, Douglas J Klein
exaly
Using Recursion to Compute the Inverse of the Genomic Relationship Matrix
Journal of Dairy Science, 2014Andrés Legarra +2 more
exaly
Foraging Site Recursion by Forest Elephants Elephas maximus Borneensis
Environmental Epigenetics, 2014Marc Ancrenaz +2 more
exaly