most citedOn fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2024★ 2 cited

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

Asier Estevan, Juan-José Minãna, Oscar Valero

The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypot…