InforLorV4, Main, Merge, bibRecord, 007064

An arithmetic for non-size-increasing polynomial-time computation

Identifieur interne : 007064 ( Main/Merge ); précédent : 007063; suivant : 007065

An arithmetic for non-size-increasing polynomial-time computation

Auteurs : Klaus Aehlig [Allemagne] ; Ulrich Berger [Royaume-Uni] ; Martin Hofinann [Allemagne] ; Helmut Schwichtenberg [Allemagne]

Source :

Theoretical computer science [ 0304-3975 ] ; 2004.

RBID : Pascal:04-0318307

Descripteurs français

Pascal (Inist)
- Algorithmique, Temps polynomial, Temps calcul, Fonction polynomiale, Informatique théorique.

English descriptors

KwdEn :
- Algorithmics, Computation time, Computer theory, Polynomial function, Polynomial time.

Abstract

An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel's T and therefore defines a non-size-increasing polynomial time computable function.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000666
to stream PascalFrancis, to step Curation: 000375
to stream PascalFrancis, to step Checkpoint: 000629

Links to Exploration step

Pascal:04-0318307

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An arithmetic for non-size-increasing polynomial-time computation</title>
<author><name sortKey="Aehlig, Klaus" sort="Aehlig, Klaus" uniqKey="Aehlig K" first="Klaus" last="Aehlig">Klaus Aehlig</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Mathematisches Institut, Universität München, Theresienstrasse 39</s1>
<s2>80333 München</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
<author><name sortKey="Berger, Ulrich" sort="Berger, Ulrich" uniqKey="Berger U" first="Ulrich" last="Berger">Ulrich Berger</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science, University of Wales Swansea, Singleton Park</s1>
<s2>Swansea SA2 8PP</s2>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Swansea SA2 8PP</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Hofinann, Martin" sort="Hofinann, Martin" uniqKey="Hofinann M" first="Martin" last="Hofinann">Martin Hofinann</name>
<affiliation wicri:level="4"><inist:fA14 i1="03"><s1>Institut für Informatik, Universität Munchen, Oettingenstrasse 67</s1>
<s2>80538 München</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
<author><name sortKey="Schwichtenberg, Helmut" sort="Schwichtenberg, Helmut" uniqKey="Schwichtenberg H" first="Helmut" last="Schwichtenberg">Helmut Schwichtenberg</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Mathematisches Institut, Universität München, Theresienstrasse 39</s1>
<s2>80333 München</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0318307</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0318307 INIST</idno>
<idno type="RBID">Pascal:04-0318307</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000666</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000375</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000629</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000629</idno>
<idno type="wicri:doubleKey">0304-3975:2004:Aehlig K:an:arithmetic:for</idno>
<idno type="wicri:Area/Main/Merge">007064</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An arithmetic for non-size-increasing polynomial-time computation</title>
<author><name sortKey="Aehlig, Klaus" sort="Aehlig, Klaus" uniqKey="Aehlig K" first="Klaus" last="Aehlig">Klaus Aehlig</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Mathematisches Institut, Universität München, Theresienstrasse 39</s1>
<s2>80333 München</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
<author><name sortKey="Berger, Ulrich" sort="Berger, Ulrich" uniqKey="Berger U" first="Ulrich" last="Berger">Ulrich Berger</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science, University of Wales Swansea, Singleton Park</s1>
<s2>Swansea SA2 8PP</s2>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Swansea SA2 8PP</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Hofinann, Martin" sort="Hofinann, Martin" uniqKey="Hofinann M" first="Martin" last="Hofinann">Martin Hofinann</name>
<affiliation wicri:level="4"><inist:fA14 i1="03"><s1>Institut für Informatik, Universität Munchen, Oettingenstrasse 67</s1>
<s2>80538 München</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
<author><name sortKey="Schwichtenberg, Helmut" sort="Schwichtenberg, Helmut" uniqKey="Schwichtenberg H" first="Helmut" last="Schwichtenberg">Helmut Schwichtenberg</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Mathematisches Institut, Universität München, Theresienstrasse 39</s1>
<s2>80333 München</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
<settlement type="city">Munich</settlement>
</placeName>
<orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2004">2004</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithmics</term>
<term>Computation time</term>
<term>Computer theory</term>
<term>Polynomial function</term>
<term>Polynomial time</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithmique</term>
<term>Temps polynomial</term>
<term>Temps calcul</term>
<term>Fonction polynomiale</term>
<term>Informatique théorique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel's T and therefore defines a non-size-increasing polynomial time computable function.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>Royaume-Uni</li>
</country>
<region><li>Bavière</li>
<li>District de Haute-Bavière</li>
</region>
<settlement><li>Munich</li>
</settlement>
<orgName><li>Université Louis-et-Maximilien de Munich</li>
</orgName>
</list>
<tree><country name="Allemagne"><region name="Bavière"><name sortKey="Aehlig, Klaus" sort="Aehlig, Klaus" uniqKey="Aehlig K" first="Klaus" last="Aehlig">Klaus Aehlig</name>
</region>
<name sortKey="Hofinann, Martin" sort="Hofinann, Martin" uniqKey="Hofinann M" first="Martin" last="Hofinann">Martin Hofinann</name>
<name sortKey="Schwichtenberg, Helmut" sort="Schwichtenberg, Helmut" uniqKey="Schwichtenberg H" first="Helmut" last="Schwichtenberg">Helmut Schwichtenberg</name>
</country>
<country name="Royaume-Uni"><noRegion><name sortKey="Berger, Ulrich" sort="Berger, Ulrich" uniqKey="Berger U" first="Ulrich" last="Berger">Ulrich Berger</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007064 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007064 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:04-0318307
   |texte=   An arithmetic for non-size-increasing polynomial-time computation
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

An arithmetic for non-size-increasing polynomial-time computation

An arithmetic for non-size-increasing polynomial-time computation

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri