Fast and simple nested fixpoints
Identifieur interne : 001575 ( PascalFrancis/Curation ); précédent : 001574; suivant : 001576Fast and simple nested fixpoints
Auteurs : H. Seidl [Allemagne]Source :
- Information processing letters [ 0020-0190 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d.(h.|e|/(d - 1))[d/2]+1). The advantage of our proof is that it is both extremely short and extremely simple.
| pA |
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001417
Links to Exploration step
Pascal:97-0050234Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0050234</idno><date when="1996">1996</date><idno type="stanalyst">PASCAL 97-0050234 INIST</idno><idno type="RBID">Pascal:97-0050234</idno><idno type="wicri:Area/PascalFrancis/Corpus">001417</idno><idno type="wicri:Area/PascalFrancis/Curation">001575</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country></affiliation></author></analytic><series><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno><imprint><date when="1996">1996</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term><term>Computational complexity</term><term>Equation system</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Complexité calcul</term><term>Système équation</term><term>Algorithme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d.(h.|e|/(d - 1))<sup>[d/2]+1</sup>). The advantage of our proof is that it is both extremely short and extremely simple.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0020-0190</s0></fA01><fA02 i1="01"><s0>IFPLAT</s0></fA02><fA03 i2="1"><s0>Inf. process. lett.</s0></fA03><fA05><s2>59</s2></fA05><fA06><s2>6</s2></fA06><fA08 i1="01" i2="1" l="ENG"><s1>Fast and simple nested fixpoints</s1></fA08><fA11 i1="01" i2="1"><s1>SEIDL (H.)</s1></fA11><fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></fA14><fA20><s1>303-308</s1></fA20><fA21><s1>1996</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>15156</s2><s5>354000067026830030</s5></fA43><fA44><s0>0000</s0><s1>© 1997 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>15 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>97-0050234</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Information processing letters</s0></fA64><fA66 i1="01"><s0>NLD</s0></fA66><fC01 i1="01" l="ENG"><s0>We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d.(h.|e|/(d - 1))<sup>[d/2]+1</sup>). The advantage of our proof is that it is both extremely short and extremely simple.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02A05</s0></fC02><fC03 i1="01" i2="1" l="FRE"><s0>Complexité calcul</s0><s3>P</s3><s5>01</s5></fC03><fC03 i1="01" i2="1" l="ENG"><s0>Computational complexity</s0><s3>P</s3><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Système équation</s0><s5>37</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Equation system</s0><s5>37</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Sistema ecuación</s0><s5>37</s5></fC03><fC03 i1="03" i2="1" l="FRE"><s0>Algorithme</s0><s5>38</s5></fC03><fC03 i1="03" i2="1" l="ENG"><s0>Algorithms</s0><s5>38</s5></fC03><fN21><s1>027</s1></fN21></pA></standard></inist></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001575 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 001575 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:97-0050234
|texte= Fast and simple nested fixpoints
}}
| This area was generated with Dilib version V0.6.31. |  |