Duality of Fix-Points for Distributive Lattices
Data Structures and Algorithms
2007-05-23 v1 Discrete Mathematics
Abstract
We 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.
Cite
@article{arxiv.cs/0609118,
title = {Duality of Fix-Points for Distributive Lattices},
author = {Prahladavaradan Sampath},
journal= {arXiv preprint arXiv:cs/0609118},
year = {2007}
}
Comments
7 pages