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 « complete »
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.
complemented < complete < completeness  Facettes :

List of bibliographic references indexed by complete

Number of relevant bibliographic references: 67.
[20-40] [0 - 20][0 - 50][40-60]
Ident.Authors (with country if any)Title
008306 (2002) Yves Pétermann ; Jean-Luc RémyError analysis for an arbitrary precision in computing zeta(s) with the Cohen-Olivier algorithm : complete description of the real case and preliminary report on the general case
008B46 (2002) Yves Pétermann [France] ; Jean-Luc Rémy [France]Error analysis for an arbitrary precision in computing zeta(s) with the Cohen-Olivier algorithm : complete description of the real case and preliminary report on the general case
008C85 (2001-06-11) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol Insecurity with Finite Number of Sessions is NP-complete
009044 (2001) Jens Gustedt ; Jan Arne TelleA Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem
009105 (2001) Michael Rusinowitch ; Mathieu TuruaniProtocol Insecurity with Finite Number of Sessions is NP-complete
009598 (2001) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol Insecurity with Finite Number of Sessions is NP-complete
009704 (2001) Jens Gustedt [France] ; Jan Arne TelleA Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem
009B78 (2000) Arnaud Durand ; Miki Hermann ; Phokion G. KolaitisSubtractive Reductions and Complete Problems for Counting Complexity Classes
009C56 (2000) Philippe De GrooteLinear higher-order matching is NP-complete
009C94 (2000) Philippe Dosch ; Karl Tombre ; Christian Ah-Soon ; Gerald MasiniA complete system for analysis of architectural drawings
009E24 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Subtractive Reductions and Complete Problems for Counting Complexity Classes
009E72 (2000) Philippe De Groote [France]Linear Higher-Order Matching Is NP-Complete
009F34 (2000) W. J. Fokkink [Pays-Bas] ; S. P. Luttik [Pays-Bas]An ω-Complete Equational Specification of Interleaving
009F43 (2000) Philippe Dosch ; Karl Tombre ; Christian Ah-Soon ; Gérald MasiniA complete system for the analysis of architectural drawings
009F50 (2000) Hans Zantema ; Alfons Geser [États-Unis]A Complete Characterization of Termination of 0p 1q→ 1r 0s
00A135 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [Canada]Subtractive Reductions and Complete Problems for Counting Complexity Classes
00A191 (2000) Philippe De Groote [France]Linear higher-order matching is NP-complete
00A775 (1999) Guy PerrierA PSPACE-complete fragment of second-order linear logic
00A814 (1999) Hubert Comon ; Florent JacquemardGround Reducibility is EXPTIME-complete
00AC96 (1999) Hubert Comon ; Florent Jacquemard [France]Ground Reducibility is EXPTIME-complete
00B194 (1998) Jean Lieber ; Amedeo NapoliCorrect and Complete Retrieval for Case-Based Problem-Solving

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 "complete" 

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