Complexité automate < Complexité calcul < Complexité combinatoire

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

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000228 (2009)	Th. Meilender [France] ; Abdel Belaïd [France]	Segmentation of Continuous Document Flow by a modified Backward-Forward algorithm
000285 (2008)	Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France]	A Logical Account of PSPACE
000456 (2005)	Murat Deviren [France] ; Khalid Daoudi [France] ; Kamel Smaïli [France]	Rethinking language models within the framework of dynamic bayesian networks
000565 (2004)	G. Hanrot [France] ; M. Quercia ; P. Zimmermann	The middle product algorithm I. Speeding up the division and square root of power series
000584 (2004)	L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne]	On the computational complexity of imperative programming languages
000585 (2004)	James S. Royer [États-Unis]	On the computational complexity of Longley's H functional
000625 (2004)	Ralph Benzinger [États-Unis]	Automated higher-order complexity analysis
000723 (2003)	J. Y. Marion [France]	Analysing the implicit complexity of programs
000810 (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
000909 (2001)	A. Bockmayr [France] ; F. Eisenbrand	Cutting planes and the elementary closure in fixed dimension
000921 (2001)	Jean-Yves Marion [France]	Actual arithmetic and feasibility
000962 (2000)	V. D. Blondel [Belgique] ; O. Bournez [France] ; P. Koiran [France] ; J. N. Tsitsiklis [États-Unis]	The stability of saturated linear dynamical systems is undecidable
000967 (2000)	A. Durand [France] ; M. Hermann [France] ; P. G. Kolaitis [États-Unis]	Subtractive reductions and complete problems for counting complexity classes
000992 (2000)	J. Zhou [France]	Introduction to the constraint language NCL
000A34 (2000)	D. Leivant [États-Unis] ; J.-Y. Marion [France]	A characterization of alternating log time by ramified recurrence
000A61 (1999)	B. Gaujal [France] ; N. Navet	Traffic shaping in real-time distributed systems: A low-complexity approach
000A65 (1999)	D. A. Plaisted [États-Unis] ; G. Kucherov [France]	The complexity of some complementation problems
000A68 (1999)	P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis]	RPO constraint solving is in NP
000A71 (1999)	M. Hermann [France] ; L. Juban [France] ; P. G. Kolaitis [États-Unis]	On the complexity of counting the Hilbert basis of a linear Diophantine system
000A83 (1999)	J.-Y. Marion [France]	From multiple sequent for additive linear logic to decision procedures for free lattices
000A97 (1999)	G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France]	Complexity classes and rewrite systems with polynomial interpretation

---

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

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

---

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