Titre (en)
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Titre (en) » - entrée « polynomial »
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.
polymorphous < polynomial < polynomiales  Facettes :

List of bibliographic references indexed by polynomial

Number of relevant bibliographic references: 112.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
000040 (2016-04-18) Frédéric Bihan [France] ; Pierre-Jean Spaenlehauer [France]Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes
000072 (2016-02-01) Jean-Guillaume Dumas [France] ; Erich Kaltofen [États-Unis] ; Emmanuel Thomé [France] ; Gilles Villard [France]Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
000103 (2016) Razvan Barbulescu [France] ; Armand Lachand [France]Some mathematical remarks on the polynomial selection in NFS
000211 (2015-11-30) Emmanuel Hainry [France] ; Romain Péchoux [France]Objects in Polynomial Time
000664 (2015-01-01) Hugo Férée [France] ; Emmanuel Hainry [France] ; Mathieu Hoyrup [France] ; Romain Péchoux [France]Characterizing polynomial time complexity of stream programs using interpretations
000713 (2015) Fabien Lauer [France] ; Henrik Ohlsson [États-Unis]Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
000717 (2015) Romain Cosset [France] ; Damien Robert [France]Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves
000822 (2014-12-18) Nicholas Coxon [France]Montgomery's method of polynomial selection for the number field sieve
000B91 (2014-05) Razvan Barbulescu [France] ; Pierrick Gaudry [France] ; Antoine Joux [France] ; Emmanuel Thomé [France]A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
000D41 (2014) Miguel Couceiro [France] ; Tamas Waldhauser [Luxembourg (pays)]Pseudo-polynomial functions over finite distributive lattices
000D49 (2014) Eugene A. Feinberg [États-Unis] ; Jefferson Huang [États-Unis] ; Bruno Scherrer [France]Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
000D85 (2014) Miguel Couceiro [France] ; Erkko Lehtonen [Luxembourg (pays)] ; Tamas Waldhauser [Luxembourg (pays)]Additive decomposition schemes for polynomial functions over fields
001088 (2013-08) Gilles-Philippe Paillé [Canada] ; Pierre Poulain [Canada] ; Bruno Lévy [France]Fitting Polynomial Volumes to Surface Meshes with Voronoï Squared Distance Minimization
001092 (2013-07-26) Guillaume Moroz [France]Fast polynomial evaluation and composition
001265 (2013-04) Jean-Charles Faugère [France] ; Pierrick Gaudry [France] ; Louise Huot [France] ; Guénaël Renault [France]Polynomial Systems Solving by Fast Linear Algebra
001368 (2013) Miguel Couceiro [France] ; Tamas Waldhauser [Luxembourg (pays)]Interpolation by polynomial functions of distributive lattices : a generalization of a theorem of R. L. Goodstein
001A30 (2012-07-09) Miguel Couceiro [France] ; Didier Dubois [France] ; Henri Prade [France] ; Agnès Rico [France] ; Tamas Waldhauser [Hongrie]General Interpolation by Polynomial Functions of Distributive Lattices
001C69 (2012) Miguel Couceiro [France] ; Jean-Luc Marichal [Luxembourg (pays)]Polynomial functions over bounded distributive lattices
001C74 (2012) Thomas Prest [France] ; Paul Zimmermann [France]Non-Linear Polynomial Selection for the Number Field Sieve
001C94 (2012) Miguel Couceiro [France] ; Mike Behrisch [Allemagne] ; Erkko Lehtonen [Luxembourg (pays)] ; Keith A. Kearnes [États-Unis] ; Ágnes Szendrei [États-Unis]Commuting polynomial operations of distributive lattices
002225 (2011-07-16) Raz Nissim [Israël] ; Joerg Hoffmann [France] ; Malte Helmert [Allemagne]Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "polynomial" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "polynomial" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    polynomial
}}
Wicri

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