Duality of Fix-Points for Distributive Lattices
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 applicat...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Sampath, Prahladavaradan |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.cs/0609118 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_cs_0609118</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cs_0609118</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-71beee5aaddbb1c9f6cfa4edf4d3131ffd36b75fb1738978e347cd0b24355b173</originalsourceid><addsrcrecordid>eNotjstqAjEUQLPpoth-QFfmB8ZJmmSSWYrWtjCgC_fDzePCBXUkiaJ_X9q6OnAWh8PYmxQL7YwRLeQbXRehtKITvZTumbXrCxyo3vmEfEO3ZjfRqRaOU-ZrKjWTv1S6Jj5ArRRSeWFPCIeSXh-csf3mY7_6aobt5_dqOTTQWddY6VNKBiBG72XosQsIOkXUUUklEaPqvDXopVWuty4pbUMU_l0rY37ljM3_s3_H4znTEfJ9DGV8nKsfmiI_XA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Duality of Fix-Points for Distributive Lattices</title><source>arXiv.org</source><creator>Sampath, Prahladavaradan</creator><creatorcontrib>Sampath, Prahladavaradan</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.cs/0609118</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Discrete Mathematics</subject><creationdate>2006-09</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/cs/0609118$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.cs/0609118$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sampath, Prahladavaradan</creatorcontrib><title>Duality of Fix-Points for Distributive Lattices</title><description>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.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjstqAjEUQLPpoth-QFfmB8ZJmmSSWYrWtjCgC_fDzePCBXUkiaJ_X9q6OnAWh8PYmxQL7YwRLeQbXRehtKITvZTumbXrCxyo3vmEfEO3ZjfRqRaOU-ZrKjWTv1S6Jj5ArRRSeWFPCIeSXh-csf3mY7_6aobt5_dqOTTQWddY6VNKBiBG72XosQsIOkXUUUklEaPqvDXopVWuty4pbUMU_l0rY37ljM3_s3_H4znTEfJ9DGV8nKsfmiI_XA</recordid><startdate>20060921</startdate><enddate>20060921</enddate><creator>Sampath, Prahladavaradan</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20060921</creationdate><title>Duality of Fix-Points for Distributive Lattices</title><author>Sampath, Prahladavaradan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-71beee5aaddbb1c9f6cfa4edf4d3131ffd36b75fb1738978e347cd0b24355b173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>Sampath, Prahladavaradan</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sampath, Prahladavaradan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Duality of Fix-Points for Distributive Lattices</atitle><date>2006-09-21</date><risdate>2006</risdate><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.</abstract><doi>10.48550/arxiv.cs/0609118</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.cs/0609118 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_cs_0609118 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics |
| title | Duality of Fix-Points for Distributive Lattices |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T11%3A11%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Duality%20of%20Fix-Points%20for%20Distributive%20Lattices&rft.au=Sampath,%20Prahladavaradan&rft.date=2006-09-21&rft_id=info:doi/10.48550/arxiv.cs/0609118&rft_dat=%3Carxiv_GOX%3Ecs_0609118%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |