Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « Keywords » - entrée « Computational 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.
Computational chemistry < Computational complexity < Computational geometry  Facettes :

List of bibliographic references indexed by Computational complexity

Number of relevant bibliographic references: 31.
[20-40] [0 - 20][0 - 31]
Ident.Authors (with country if any)Title
00A862 (1999) G. Perrier [France]A PSPACE-complete fragment of second-order linear logic
00A910 (1999) B. Gaujal [France] ; N. Navet [France]Traffic shaping in real-time distributed systems: a low-complexity approach
00A946 (1999) Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] ; Rakesh Verma [États-Unis]RPO Constraint Solving Is in NP
00A959 (1999) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
00AA29 (1999) G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France]Complexity Classes and Rewrite Systems with Polynomial Interpretation
00BC23 (1997) Daniel Leivant [États-Unis] ; Jean-Yves Marion [France]Predicative functional recurrence and poly-space
00BC30 (1997) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
00BC84 (1997) L. Alonso [France] ; J. L. Rémy [France] ; R. Schott [France]A linear-time algorithm for the generation of trees
00BD17 (1997) L. Alonso [France] ; E. M. Reingold [États-Unis] ; R. Schott [France]The average-case complexity of determining the majority
00C079 (1996) Nadia Creignou [France] ; Miki Hermann [France]Complexity of Generalized Satisfiability Counting Problems
00C816 (1995) J.-M. Gallone [France] ; F. Charpillet [France] ; F. Alexandre [France]Anytime scheduling with neural networks

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

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