InforLorV4, Hal, Checkpoint, bibRecord, 003D36

Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator

Identifieur interne : 003D36 ( Hal/Checkpoint ); précédent : 003D35; suivant : 003D37

Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator

Auteurs : Alin Bostan [France] ; Pierrick Gaudry [France] ; Eric Schost [France]

Source :

SIAM Journal on Computing [ 0097-5397 ] ; 2007.

RBID : Hal:inria-00103401

Abstract

We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically, and for computing the Cartier-Manin operator of hyperelliptic curves.

Url:

https://hal.inria.fr/inria-00103401

DOI: 10.1137/S0097539704443793

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

to stream Hal, to step Corpus: 002F18
to stream Hal, to step Curation: 002F18

Links to Exploration step

Hal:inria-00103401

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator</title>
<author><name sortKey="Bostan, Alin" sort="Bostan, Alin" uniqKey="Bostan A" first="Alin" last="Bostan">Alin Bostan</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2407" status="OLD"><idno type="RNSR">198121341J</idno>
<orgName>Algorithms</orgName>
<orgName type="acronym">ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/algo</ref>
</desc>
<listRelation><relation active="#struct-86790" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-86790" type="direct"><org type="laboratory" xml:id="struct-86790" status="VALID"><idno type="RNSR">196718247G</idno>
<orgName>INRIA Paris-Rocquencourt</orgName>
<desc><address><addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex / INRIA Paris - 23 avenue d'Italie 75013 Paris</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-56056" status="OLD"><idno type="RNSR">200318378T</idno>
<orgName>Algorithmic number theory for cryptology</orgName>
<orgName type="acronym">TANC</orgName>
<desc><address><addrLine>LIX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/tanc</ref>
</desc>
<listRelation><relation active="#struct-2071" type="direct"></relation>
<relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
<relation active="#struct-118511" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-2071" type="direct"><org type="laboratory" xml:id="struct-2071" status="VALID"><orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
<orgName type="acronym">LIX</orgName>
<desc><address><addrLine>Route de Saclay 91128 PALAISEAU CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lix.polytechnique.fr/</ref>
</desc>
<listRelation><relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300340" type="direct"><org type="institution" xml:id="struct-300340" status="VALID"><orgName>Polytechnique - X</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR7161" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-118511" type="direct"><org type="laboratory" xml:id="struct-118511" status="VALID"><idno type="RNSR">200818248E</idno>
<orgName>INRIA Saclay - Ile de France</orgName>
<desc><address><addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre/saclay</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Schost, Eric" sort="Schost, Eric" uniqKey="Schost E" first="Eric" last="Schost">Eric Schost</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-2071" status="VALID"><orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
<orgName type="acronym">LIX</orgName>
<desc><address><addrLine>Route de Saclay 91128 PALAISEAU CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lix.polytechnique.fr/</ref>
</desc>
<listRelation><relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300340" type="direct"><org type="institution" xml:id="struct-300340" status="VALID"><orgName>Polytechnique - X</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR7161" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00103401</idno>
<idno type="halId">inria-00103401</idno>
<idno type="halUri">https://hal.inria.fr/inria-00103401</idno>
<idno type="url">https://hal.inria.fr/inria-00103401</idno>
<idno type="doi">10.1137/S0097539704443793</idno>
<date when="2007">2007</date>
<idno type="wicri:Area/Hal/Corpus">002F18</idno>
<idno type="wicri:Area/Hal/Curation">002F18</idno>
<idno type="wicri:Area/Hal/Checkpoint">003D36</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003D36</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator</title>
<author><name sortKey="Bostan, Alin" sort="Bostan, Alin" uniqKey="Bostan A" first="Alin" last="Bostan">Alin Bostan</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2407" status="OLD"><idno type="RNSR">198121341J</idno>
<orgName>Algorithms</orgName>
<orgName type="acronym">ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/algo</ref>
</desc>
<listRelation><relation active="#struct-86790" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-86790" type="direct"><org type="laboratory" xml:id="struct-86790" status="VALID"><idno type="RNSR">196718247G</idno>
<orgName>INRIA Paris-Rocquencourt</orgName>
<desc><address><addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex / INRIA Paris - 23 avenue d'Italie 75013 Paris</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-56056" status="OLD"><idno type="RNSR">200318378T</idno>
<orgName>Algorithmic number theory for cryptology</orgName>
<orgName type="acronym">TANC</orgName>
<desc><address><addrLine>LIX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/tanc</ref>
</desc>
<listRelation><relation active="#struct-2071" type="direct"></relation>
<relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
<relation active="#struct-118511" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-2071" type="direct"><org type="laboratory" xml:id="struct-2071" status="VALID"><orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
<orgName type="acronym">LIX</orgName>
<desc><address><addrLine>Route de Saclay 91128 PALAISEAU CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lix.polytechnique.fr/</ref>
</desc>
<listRelation><relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300340" type="direct"><org type="institution" xml:id="struct-300340" status="VALID"><orgName>Polytechnique - X</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR7161" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-118511" type="direct"><org type="laboratory" xml:id="struct-118511" status="VALID"><idno type="RNSR">200818248E</idno>
<orgName>INRIA Saclay - Ile de France</orgName>
<desc><address><addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre/saclay</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Schost, Eric" sort="Schost, Eric" uniqKey="Schost E" first="Eric" last="Schost">Eric Schost</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-2071" status="VALID"><orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
<orgName type="acronym">LIX</orgName>
<desc><address><addrLine>Route de Saclay 91128 PALAISEAU CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lix.polytechnique.fr/</ref>
</desc>
<listRelation><relation active="#struct-300340" type="direct"></relation>
<relation name="UMR7161" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300340" type="direct"><org type="institution" xml:id="struct-300340" status="VALID"><orgName>Polytechnique - X</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR7161" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1137/S0097539704443793</idno>
<series><title level="j">SIAM Journal on Computing</title>
<idno type="ISSN">0097-5397</idno>
<imprint><date type="datePub">2007</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically, and for computing the Cartier-Manin operator of hyperelliptic curves.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator</title>
<author role="aut"><persName><forename type="first">Alin</forename>
<surname>Bostan</surname>
</persName>
<email>Alin.Bostan@inria.fr</email>
<idno type="halauthor">75822</idno>
<affiliation ref="#struct-2407"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>gaudry@loria.fr</email>
<idno type="idhal">pierrickgaudry</idno>
<idno type="halauthor">66001</idno>
<affiliation ref="#struct-56056"></affiliation>
<affiliation ref="#struct-24434"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Eric</forename>
<surname>Schost</surname>
</persName>
<email></email>
<idno type="halauthor">66004</idno>
<affiliation ref="#struct-2071"></affiliation>
</author>
<editor role="depositor"><persName><forename>Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>pierrick.gaudry@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1"><date type="whenSubmitted">2006-10-04 12:17:26</date>
</edition>
<edition n="v2"><date type="whenSubmitted">2007-03-26 07:57:05</date>
</edition>
<edition n="v3" type="current"><date type="whenSubmitted">2007-03-27 09:38:43</date>
<date type="whenModified">2016-05-19 01:15:05</date>
<date type="whenReleased">2007-03-27 10:32:28</date>
<date type="whenProduced">2007</date>
<date type="whenEndEmbargoed">2007-03-27</date>
<ref type="file" target="https://hal.inria.fr/inria-00103401v3/document"><date notBefore="2007-03-27"></date>
</ref>
<ref type="file" subtype="greenPublisher" n="1" target="https://hal.inria.fr/inria-00103401/file/pollard-final.pdf"><date notBefore="2007-03-27"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="103933"><persName><forename>Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>pierrick.gaudry@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00103401</idno>
<idno type="halUri">https://hal.inria.fr/inria-00103401</idno>
<idno type="halBibtex">bostan:inria-00103401</idno>
<idno type="halRefHtml">SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 36 (6), pp.1777-1806. <10.1137/S0097539704443793></idno>
<idno type="halRef">SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 36 (6), pp.1777-1806. <10.1137/S0097539704443793></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LIX">Laboratoire d'informatique de l'école polytechnique</idno>
<idno type="stamp" n="X-LIX" p="X">Laboratoire d'informatique de l'X (LIX)</idno>
<idno type="stamp" n="X-DEP">Polytechnique</idno>
<idno type="stamp" n="X-DEP-INFO" p="X-DEP">Département d'informatique</idno>
<idno type="stamp" n="X" p="PARISTECH">Ecole Polytechnique</idno>
<idno type="stamp" n="PARISTECH">ParisTech</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator</title>
<author role="aut"><persName><forename type="first">Alin</forename>
<surname>Bostan</surname>
</persName>
<email>Alin.Bostan@inria.fr</email>
<idno type="halAuthorId">75822</idno>
<affiliation ref="#struct-2407"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>gaudry@loria.fr</email>
<idno type="idHal">pierrickgaudry</idno>
<idno type="halAuthorId">66001</idno>
<affiliation ref="#struct-56056"></affiliation>
<affiliation ref="#struct-24434"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Eric</forename>
<surname>Schost</surname>
</persName>
<idno type="halAuthorId">66004</idno>
<affiliation ref="#struct-2071"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">8476</idno>
<idno type="issn">0097-5397</idno>
<title level="j">SIAM Journal on Computing</title>
<imprint><publisher>Society for Industrial and Applied Mathematics</publisher>
<biblScope unit="volume">36</biblScope>
<biblScope unit="issue">6</biblScope>
<biblScope unit="pp">1777-1806</biblScope>
<date type="datePub">2007</date>
</imprint>
</monogr>
<idno type="doi">10.1137/S0097539704443793</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically, and for computing the Cartier-Manin operator of hyperelliptic curves.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 003D36 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:inria-00103401
   |texte=   Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator
}}

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

Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator

Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator

Source :

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