complexite < complexity < complexity analysis

Facettes : Author.f

List of bibliographic references

Number of relevant bibliographic references: 56.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000104 (2005)	Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen ; Romain Péchoux	Synthesis of Quasi-interpretations
000134 (2005)	Julien Fondrevelle ; Ammar Oulamara ; Marie-Claude Portmann	Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
000304 (2005)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Implicit Complexity Over an Arbitrary Structure : Sequential and Parallel Polynomial Time
000657 (2004)	Dominique Barth ; Johanne Cohen ; Lynda Gastal ; Thierry Mautor ; Stéphane Rousseau	Fixed Size and Variable Size Packet Models in an Optical Ring Network : Complexity and Simulations
000700 (2004)	Olivier Bournez ; Emmanuel Hainry	An analog Characterization of Elementarily Computable Functions Over the Real Numbers
000701 (2004)	Olivier Bournez ; Emmanuel Hainry	An analog Characterization of Elementarily Computable Functions Over the Real Numbers
000839 (2004)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
000852 (2004)	Olivier Bournez ; Emmanuel Hainry	Real Recursive Functions and Real Extensions of Recursive Functions
000873 (2003)	Karell Bertet ; Jens Gustedt ; Michel Morvan	Weak-order extensions of an order
000915 (2003)	Mathieu Turuani	Sécurité des protocoles cryptographiques : décidabilité et complexité
000962 (2003)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH
000A23 (2003)	Mohab Safey El Din ; Eric Schost	Polar varieties and computation of one point in each connected component of a smooth real algebraic set
000A41 (2003)	Jean-Yves Moyen	Analyse de la complexité et transformation de programmes
000A82 (2003)	Dominique Barth ; Johanne Cohen ; Lynda Gastal ; Thierry Mautor ; Stephane Rousseau	Comparison of fixed size and variable size packet models in an optical ring network : Algorithms and performances
000B68 (2003)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
000B74 (2003)	Dominique Barth ; Cohen Johanne ; Faik Taoufik	Complexity of Determining the b-continuity Property of Graphs
000C41 (2003)	Roman Kolpakov ; Gregory Kucherov	Finding approximate repetitions under Hamming distance
000C83 (2003)	Patrick Blackburn ; Bertrand Gaiffe ; Marteen Marx	Variable-free reasoning on finite trees
000C90 (2003)	Jean-Pierre Duval ; Roman Kolpakov ; Gregory Kucherov ; Thierry Lecroq ; Arnaud Lefebvre	Linear-Time Computation of Local Periods
000C92 (2003)	Ali Basiri ; Jean-Charles Faugere	Changing the ordering of Grobner Bases with LLL : Case of Two Variables
000D19 (2003)	Carsten Lutz Lutz ; Carlos Areces ; Ian Horrocks ; Ulrike Sattler	Keys, Nominals, and Concrete Domains

---

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/KwdEn.i -k "complexity" 

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

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Crin
   |étape=   Checkpoint
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    complexity
}}

---

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