Keywords
Checkpoint
Hal
Racine
Checkpoint
Hal
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Hal)

Index « Keywords » - entrée « Complexity »
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.
Complex-valued models < Complexity < Complexity Analysis  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 14.
Ident.Authors (with country if any)Title
000296 (2015-09-20) Sylvain Gravier [France] ; Jérôme Javelle [France] ; Mehdi Mhalla [France] ; Simon Perdrix [France]On weak odd domination and graph-based quantum secret sharing
000B97 (2014-03-03) O. Sassi [France] ; A. Oulamara [France]Electric Vehicle Scheduling and Optimal Charging Problem: Complexity, Exact and Heuristic Approaches
000E14 (2013-12-01) Ammar Oulamara [France] ; Djamal Rebaine [Canada] ; Mehdi Serairi [France]Scheduling the two-machine open shop problem under resource constraints for setting the jobs
001902 (2012) Olivier Devillers [France] ; Marc Glisse [France] ; Xavier Goaoc [France] ; Guillaume Moroz [France] ; Matthias Reitzner [Allemagne]The monotonicity of f-vectors of random polytopes
002808 (2010) René Schott [France] ; Stacey Staples [États-Unis]On the complexity of cycle enumeration using Zeons
002E67 (2009) Dominique Attali [France] ; Olivier Devillers [France] ; Xavier Goaoc [France]The Effect of Noise on the Number of Extreme Points
002F05 (2009) Guillaume Bonfante [France] ; Yves Guiraud [France]Polygraphic programs and polynomial-time functions
003B16 (2007-03-31) Guillaume Bonfante [France] ; Yves Guiraud [France]Intensional properties of polygraphs
003D19 (2007) Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France]On the B-Continuity Property of Graphs
003D31 (2007) Ammar Oulamara [France]Makespan minimization in a no-wait flow shop problem with two batching machines
003D76 (2007) Bruno Gaujal [France] ; Nicolas Navet [France]Dynamic voltage scaling under EDF revisited
004620 (2005-06-24) Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] ; Romain Péchoux [France]Synthesis of Quasi-interpretations
005379 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions, composed keys is NP-complete.
005393 (2003) François Laroussinie [France] ; Philippe Schnoebelen [France] ; Mathieu Turuani [France]On the expressivity and complexity of quantitative branching-time temporal logics.

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/KwdEn.i -k "Complexity" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/KwdEn.i  \
                -Sk "Complexity" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Complexity
}}
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