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.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
000132 (2016) Miguel Couceiro [France] ; Lucien Haddad [Canada] ; Karsten Schölzel [Luxembourg (pays)] ; Tamas Waldhauser [Hongrie]A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones
000371 (2015-08-25) Tomasz Buchert [France] ; Lucas Nussbaum [France] ; Jens Gustedt [France]Towards Complete Tracking of Provenance in Experimental Distributed Systems Research
000593 (2015-04-10) Denis Roegel [France]A concise yet complete description of Schwilgué's series calculator
000671 (2015-01) Marco Voigt [Allemagne] ; Christoph Weidenbach [Allemagne]Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete
000733 (2015) Miguel Couceiro [France] ; Erkko Lehtonen [Luxembourg (pays)] ; Karsten Schölzel [Luxembourg (pays)]A complete classification of equational classes of threshold functions included in clones
000A69 (2014-07) Hubert Comon-Lundh [France] ; Véronique Cortier [France] ; Guillaume Scerri [France]A tool for automating the computationally complete symbolic attacker (Extended Abstract)
000D19 (2014-01) Dariusz Biernacki [Pologne] ; Sergueï Lenglet [France]Sound and Complete Bisimilarities for Call-by-Name and Call-by-Value Lambda-mu Calculus
000E63 (2014) Dominique Attali [France] ; Olivier Devillers [France] ; Marc Glisse [France] ; Sylvain Lazard [France]Recognizing shrinkable complexes is NP-complete
001223 (2013-05-22) Miguel Couceiro [France] ; Lucien Haddad [Canada] ; Karsten Schölzel [Luxembourg (pays)] ; Tamas Waldhauser [Hongrie]A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones
002525 (2011) Christophe Arene [France] ; Romain Cosset [France]Construction of a k-complete addition law on abelian surfaces with rational theta constants
002541 (2011) Michael Hemmer [France] ; Laurent Dupont [France] ; Sylvain Petitjean [France] ; Elmar Schömer [Allemagne]A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
003145 (2010) Javier Álvez [Espagne] ; Francisco J. L Pez-Fraguas [Espagne]A Complete Axiomatization of Strict Equality
004760 (2007-09) Guillaume Bonfante [France] ; Joseph Le Roux [France]INtersection Optimization is NP-Complete
004936 (2007-05-15) Guillaume Bonfante [France] ; Joseph Le Roux [France]Intersection Optimization is NP Complete
004947 (2007-05) Bernard Brogliato [France]Comments on "Control of a Planar Underactuated Biped on a Complete Walking Cycle"
004C88 (2007) Laurent Dupont [France] ; Michael Hemmer [Allemagne] ; Sylvain Petitjean [France] ; Elmar Schömer [Allemagne]Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
005203 (2006-02-13) Nizar Messai [France] ; Marie-Dominique Devignes [France] ; Amedeo Napoli [France] ; Malika Smaïl-Tabbone [France]BR-Explorer: A sound and complete FCA-based retrieval algorithm (Poster)
005807 (2006) Y.-F. S. Pétermann ; Jean-Luc Rémy [France]Arbitrary Precision Error Analysis for computing $\zeta(s)$ with the Cohen-Olivier algorithm: Complete description of the real case and preliminary report on the general case
006654 (2004-05) Salma Jamoussi [France] ; Kamel Smaïli [France] ; Dominique Fohr [France] ; Jean-Paul Haton [France]A complete understanding speech system based on semantic concepts
007B50 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions and composed keys is NP-complete
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

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