PascalFr.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « PascalFr.i » - entrée « Complexité calcul »
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.
Complexité automate < Complexité calcul < Complexité combinatoire  Facettes :

List of bibliographic references indexed by Complexité calcul

Number of relevant bibliographic references: 29.
[0-20] [0 - 20][0 - 29][20-28][20-40]
Ident.Authors (with country if any)Title
003B66 (2009) Th. Meilender [France] ; Abdel Belaïd [France]Segmentation of Continuous Document Flow by a modified Backward-Forward algorithm
004465 (2008) Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France]A Logical Account of PSPACE
006196 (2005) Murat Deviren [France] ; Khalid Daoudi [France] ; Kamel Smaïli [France]Rethinking Language Models Within the Framework of Dynamic Bayesian Networks
006B14 (2004) Guillaume Hanrot [France] ; Michel Quercia [France] ; Paul Zimmermann [France]The Middle Product Algorithm I
006C99 (2004) L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne]On the computational complexity of imperative programming languages
006D00 (2004) James S. Royer [États-Unis]On the computational complexity of Longley's H functional
006D20 (2004) Ralph Benzinger [États-Unis]Automated higher-order complexity analysis
007B71 (2003) J. Y. Marion [France]Analysing the implicit complexity of programs
008915 (2002) Christophe Cerisara [France] ; Jean-Claude Junqua [États-Unis] ; Luca Rigazio [États-Unis]Dynamic estimation of a noise over estimation factor for Jacobian-based adaptation
009390 (2001) Jean-Yves Marion [France]Actual Arithmetic and Feasibility
009444 (2001) A. Bockmayr [France] ; F. EisenbrandCutting planes and the elementary closure in fixed dimension
009D40 (2000) Jianyang Zhou [France]Introduction to the constraint language NCL
009D70 (2000) Daniel Leivant [États-Unis] ; Jean-Yves Marion [États-Unis, France]A characterization of alternating log time by ramified recurrence
009E15 (2000) Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; John N. Tsitsiklis [États-Unis]The Stability of Saturated Linear Dynamical Systems Is Undecidable
009E24 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Subtractive Reductions and Complete Problems for Counting Complexity Classes
00A825 (1999) David A. Plaisted [États-Unis] ; Gregory Kucherov [États-Unis, France]The complexity of some complementation problems
00A844 (1999) Jean-Yves Marion [France]From multiple sequent for additive linear logic to decision procedures for free lattices
00A857 (1999) Philippe De Groote [France]An algebraic correctness criterion for intuitionistic multiplicative proof-nets
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

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/PascalFr.i -k "Complexité calcul" 

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