skip to main content

WORST-CASE COMPLEXITY BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF INFINITE ABELIAN GROUPS AND SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS.

Philadelphia : SIAM, 1989

Voir les exemplaires

  • Titre:
    WORST-CASE COMPLEXITY BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF INFINITE ABELIAN GROUPS AND SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS.
  • Sujets: Algorithmes ;
    Algèbre linéaire ;
    THEORIE DE LA COMPLEXITE ;
    EQUATION DIOPHANTIENNE ;
    H-INF.TH.
  • Description: Mines : MAJ:89-12-06
  • Éditeur: Philadelphia : SIAM
  • Date de publication: 1989
  • Format: P. 670 A 678 : 11 RF ; 25 CM
  • Source: Mines ParisTech (catalogue)

Recherche dans les bases de données distantes en cours. Merci de patienter.

  • Recherche
  • dansscope:(33PSL-CNSAD),scope:(33PSL-EHESS),scope:(33PSL-PSL_OMEKA),scope:(33PSL-MINES),scope:(33PSL-EFEO),scope:(33PSL-CNSMDP),scope:(33PSL-CHIMIE),scope:(33PSL),scope:("DAU"),scope:(33PSL-CDF),scope:(33PSL-ENS),scope:("33PSL-OBSERV"),scope:("33PSL-ESPCI"),scope:(33PSL-CURIE),scope:(33PSL-ENSBA),scope:("33PSL-ENC"),scope:(33PSL-PSL_STAR),scope:(33PSL-PSL_SFX),scope:("33PSL-EPHE"),scope:(33PSL-ENSAD),primo_central_multiple_fe
  • Afficher ce qui a déjà été récupéré