Complexe visibilité < Complexité < Complexité Kolmogorov

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000006 (2014)	Jean-Charles Faugere [France] ; Pierrick Gaudry [France] ; Louise Huot [France] ; Guénaël Renault [France]	Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm
000101 (2012)	A. Bellanger [France] ; A. Janiak [Pologne] ; M. Y. Kovalyov [Biélorussie] ; A. Oulamara [France]	Scheduling an unbounded batching machine with job processing time compatibilities
000124 (2011)	G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France]	Quasi-interpretations a way to control resources
000275 (2008)	Hervé Brönnimann [États-Unis] ; Olivier Devillers [France] ; Vida Dujmovic [Canada] ; Hazel Everett [France] ; Marc Glisse [France] ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Hyeon-Suk Na [Corée du Sud] ; Sue Whitesides [Canada]	LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA
000296 (2007)	Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France]	On the b-continuity property of graphs
000467 (2005)	Dominique Martinez [France]	Oscillatory synchronization requires precise and balanced feedback inhibition in a model of the insect antennal lobe
000523 (2005)	Y. Gerard [France] ; I. Debled-Rennesson [France] ; P. Zimmermann [France]	An elementary digital plane recognition algorithm
000525 (2005)	Yannick Chevalier [France] ; Ralf Küsters [Allemagne] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France]	An NP decision procedure for protocol insecurity with XOR
000642 (2004)	Damien Stehle [France] ; Paul Zimmermann [France]	A binary recursive Gcd algorithm
000662 (2003)	Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France]	Weak-order extensions of an order
000680 (2003)	Michaël Rusinowitch [France] ; Mathieu Turuani [France]	Protocol insecurity with a finite number of sessions and composed keys is NP-complete
000685 (2003)	F. Laroussinie [France] ; Ph. Schnoebelen [France] ; M. Turuani [France]	On the expressivity and complexity of quantitative branching-time temporal logics
000686 (2003)	Sylvain Salvati [France] ; Philippe De Groote [France]	On the complexity of higher-order matching in the linear λ-Calculus
000697 (2003)	Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guerin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège]	Graph coloring on coarse grained multicomputers
000735 (2003)	N. N. Pisaruk [France]	A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
000797 (2002)	Serge Grigorieff [France] ; Jean-Yves Marion [France]	Kolmogorov complexity and non-determinism
000892 (2001)	Laurent Alonso [France] ; René Schott [France]	On the tree inclusion problem
000954 (2000)		Proof-search in Type-theoretic Languages
000959 (2000)	Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]	Unification algorithms cannot be combined in polynomial time
000A70 (1999)	A. Durand [France] ; M. Hermann [France] ; L. Juban [France]	On the complexity of recognizing the Hilbert basis of a linear Diophantine system
000D86 (1986)	R. Mohr ; T. C. Henderson ; A. Mackworth	Arc and path consistency revisited

---

List of associated Author.i

Nombre de documents	Descripteur
2	Jens Gustedt
2	Mathieu Turuani
2	Michaël Rusinowitch
1	A. Bellanger
1	A. Durand
1	A. Janiak
1	A. Mackworth
1	A. Oulamara
1	Assefaw Hadish Gebremedhin
1	Damien Stehle
1	Dominique Barth
1	Dominique Martinez
1	F. Laroussinie
1	G. Bonfante
1	Guénaël Renault
1	Hazel Everett
1	Hervé Brönnimann
1	Hyeon-Suk Na
1	I. Debled-Rennesson
1	Isabelle Guerin Lassous
1	J.-Y. Marion
1	J.-Y. Moyen
1	Jan Arne Telle
1	Jean-Charles Faugere
1	Jean-Yves Marion
1	Johanne Cohen
1	Karell Bertet
1	L. Juban
1	Laurent Alonso
1	Louise Huot
1	M. Hermann
1	M. Turuani
1	M. Y. Kovalyov
1	Marc Glisse
1	Michel Morvan
1	Miki Hermann
1	N. N. Pisaruk
1	Olivier Devillers
1	P. Zimmermann
1	Paul Zimmermann
1	Ph. Schnoebelen
1	Philippe De Groote
1	Phokion G. Kolaitis
1	Pierrick Gaudry
1	R. Mohr
1	Ralf Küsters
1	René Schott
1	Serge Grigorieff
1	Sue Whitesides
1	Sylvain Lazard
1	Sylvain Salvati
1	T. C. Henderson
1	Taoufik Faik
1	Vida Dujmovic
1	Xavier Goaoc
1	Y. Gerard
1	Yannick Chevalier

---

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/FC03.fr.i -k "Complexité" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/FC03.fr.i  \
                -Sk "Complexité" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    FC03.fr.i
   |clé=    Complexité
}}

---

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