PascalFr.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « PascalFr.i » - entrée « Complexité »
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.
Complexes multiprotéiques < Complexité < Complexité Kolmogorov  Facettes :

List of bibliographic references indexed by Complexité

Number of relevant bibliographic references: 21.
[0-20] [0 - 20][0 - 21][20-20][20-40]
Ident.Authors (with country if any)Title
000E31 (2014) Jean-Charles Faugere [France] ; Pierrick Gaudry [France] ; Louise Huot [France] ; Guénaël Renault [France]Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm
001E88 (2012) A. Bellanger [France] ; A. Janiak [Pologne] ; M. Y. Kovalyov [Biélorussie] ; A. Oulamara [France]Scheduling an unbounded batching machine with job processing time compatibilities
002804 (2011) G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France]Quasi-interpretations a way to control resources
004455 (2008) Hervé Brönnimann [États-Unis] ; Olivier Devillers [France] ; Vida Dujmovic [Canada] ; Hazel Everett [France] ; Marc Glisse [France] ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Hyeon-Suk Na [Corée du Sud] ; Sue Whitesides [Canada]LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA
004D46 (2007) Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France]On the b-continuity property of graphs
006354 (2005) Dominique Martinez [France]Oscillatory synchronization requires precise and balanced feedback inhibition in a model of the insect antennal lobe
006379 (2005) Y. Gerard [France] ; I. Debled-Rennesson [France] ; P. Zimmermann [France]An elementary digital plane recognition algorithm
006380 (2005) Yannick Chevalier [France] ; Ralf Küsters [Allemagne] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France]An NP decision procedure for protocol insecurity with XOR
006C64 (2004) Damien Stehlé [France] ; Paul Zimmermann [France]A Binary Recursive Gcd Algorithm
007A17 (2003) Sylvain Salvati [France] ; Philippe De Groote [France]On the Complexity of Higher-Order Matching in the Linear λ-Calculus
007B38 (2003) Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France]Weak-order extensions of an order
007B50 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions and composed keys is NP-complete
007B54 (2003) F. Laroussinie [France] ; Ph. Schnoebelen [France] ; M. Turuani [France]On the expressivity and complexity of quantitative branching-time temporal logics
007B58 (2003) Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guerin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège]Graph coloring on coarse grained multicomputers
007B77 (2003) N. N. Pisaruk [France]A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
008907 (2002) Serge Grigorieff [France] ; Jean-Yves Marion [France]Kolmogorov complexity and non-determinism
009319 (2001) Laurent Alonso ; René SchottOn the tree inclusion problem
009E04 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009F79 (2000) Proof-search in Type-theoretic Languages
00A958 (1999) Arnaud Durand [France] ; Miki Hermann [France] ; Laurent Juban [France]On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
00E865 (1986) R. Mohr ; T. C. Henderson ; A. MackworthArc and path consistency revisited

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/PascalFr.i -k "Complexité" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i  \
                -Sk "Complexité" \
         | 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=    PascalFr.i
   |clé=    Complexité
}}
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