KwdFr.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « KwdFr.i » - 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.
complexite < complexity < complexity analysis  Facettes :

List of bibliographic references indexed by complexity

Number of relevant bibliographic references: 27.
[0-20] [0 - 20][0 - 27][20-26][20-40]
Ident.Authors (with country if any)Title
006618 (2004-08) Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France]Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
006752 (2004) Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France]Permutation Flowshop Scheduling Problems with Maximal and Minimal Time Lags
006761 (2004) Jean-Yves Marion [France]Editorial : Implicit Computational Complexity (ICC)
006F01 (2004) Jean-Yves Marion [France]Resource Analysis by Quasi-Interpretations
006F04 (2004) Olivier Bournez [France] ; Emmanuel Hainry [France]Real Recursive Functions and Real Extensions of Recursive Functions
006F39 (2004) Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France]On complexity analysis by quasi-interpretation
006F89 (2004) Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France]Implicit Complexity over an Arbitrary Structure: Quantifier Alternations
007006 (2004) Dominique Barth [France] ; Johanne Cohen [France] ; Lynda Gastal ; Thierry Mautor [France] ; Stéphane Rousseau [France]Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations
007085 (2004) Olivier Bournez [France] ; Emmanuel Hainry [France]An analog Characterization of Elementarily Computable Functions Over the Real Numbers
007181 (2003-09) Dominique Barth [France] ; Johanne Cohen [France] ; Lynda Gastal [France] ; Thierry Mautor [France] ; Stéphane Rousseau [France]Comparison of fixed size and variable size packet models in an optical ring network: Algorithms and performances
007199 (2003-08) Jean-Pierre Duval [France] ; Roman Kolpakov ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France]Linear-Time Computation of Local Periods
007245 (2003-06) Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France]Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
007276 (2003-04) Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France]Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
007B62 (2003) Roman Kolpakov [Russie] ; Gregory Kucherov [France]Finding approximate repetitions under Hamming distance
007D19 (2003) Siva Anantharaman ; Paliath Narendran [France] ; Michaël Rusinowitch [France]ACID-Unification is NEXPTIME-Decidable
007D72 (2003) Mohab Safey El Din [France] ; Eric Schost [France]Polar varieties and computation of one point in each connected component of a smooth real algebraic set
007E01 (2003) Carsten Lutz ; Carlos Areces [France] ; Ian Horrocks ; Ulrike SattlerKeys, Nominals, and Concrete Domains
007E47 (2003) Dominique Barth ; Johanne Cohen [France] ; Faik TaoufikComplexity of Determining the b-continuity Property of Graphs
008008 (2002-07) Olivier Bournez [France] ; Paulin De Naurois [France] ; Jean-Yves Marion [France]Safe Recursion and Calculus over an Arbitrary Structure
008A71 (2002) Olivier Bournez [France] ; Paulin De Naurois [France] ; Jean-Yves Marion [France]Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time
009444 (2001) A. Bockmayr [France] ; F. EisenbrandCutting planes and the elementary closure in fixed dimension

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/KwdFr.i -k "complexity" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdFr.i  \
                -Sk "complexity" \
         | 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=    KwdFr.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