Duality of Fix-Points for Distributive Lattices

Simple item page
dc.creatorSampath, Prahladavaradan
dc.date2006-09-21
dc.date.accessioned2026-07-07T07:23:55Z
dc.date.available2026-07-07T07:23:55Z
dc.descriptionWe present a novel algorithm for calculating fix-points. The algorithm calculates fix-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f; this is in comparison to traditional algorithms that are based on iterated application of f until a fix-point is reached.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/cs/0609118
dc.identifierhttp://arxiv.org/abs/cs/0609118
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116165
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.titleDuality of Fix-Points for Distributive Lattices
dc.typetext

Files

Collections

arXiv