Complexité calcul And NotG. Hanrot
List of bibliographic references
Number of relevant bibliographic references: 28.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000228 | Th. Meilender [France] ; Abdel Belaïd [France] | Segmentation of Continuous Document Flow by a modified Backward-Forward algorithm |
| 000285 | Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France] | A Logical Account of PSPACE |
| 000456 | Murat Deviren [France] ; Khalid Daoudi [France] ; Kamel Smaïli [France] | Rethinking language models within the framework of dynamic bayesian networks |
| 000584 | L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne] | On the computational complexity of imperative programming languages |
| 000585 | James S. Royer [États-Unis] | On the computational complexity of Longley's H functional |
| 000625 | Ralph Benzinger [États-Unis] | Automated higher-order complexity analysis |
| 000723 | J. Y. Marion [France] | Analysing the implicit complexity of programs |
| 000810 | 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 | A. Bockmayr [France] ; F. Eisenbrand | Cutting planes and the elementary closure in fixed dimension |
| 000921 | Jean-Yves Marion [France] | Actual arithmetic and feasibility |
| 000962 | 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 | A. Durand [France] ; M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Subtractive reductions and complete problems for counting complexity classes |
| 000992 | J. Zhou [France] | Introduction to the constraint language NCL |
| 000A34 | D. Leivant [États-Unis] ; J.-Y. Marion [France] | A characterization of alternating log time by ramified recurrence |
| 000A61 | B. Gaujal [France] ; N. Navet | Traffic shaping in real-time distributed systems: A low-complexity approach |
| 000A65 | D. A. Plaisted [États-Unis] ; G. Kucherov [France] | The complexity of some complementation problems |
| 000A68 | P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis] | RPO constraint solving is in NP |
| 000A71 | 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 | J.-Y. Marion [France] | From multiple sequent for additive linear logic to decision procedures for free lattices |
| 000A97 | G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France] | Complexity classes and rewrite systems with polynomial interpretation |
| 000B01 | P. De Groote [France] | An algebraic correctness criterion for intuitionistic multiplicative proof-nets |
| 000B11 | G. Perrier [France] | A PSPACE-complete fragment of second-order linear logic |
| 000C04 | L. Alonso [France] ; E. M. Reingold [États-Unis] ; R. Schott [France] | The average-case complexity of determining the majority |
| 000C14 | D. Leivant [États-Unis] ; J.-Y. Marion [France] | Predicative functional recurrence and poly-space |
| 000C19 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
| 000C47 | L. Alonso [France] ; J. L. Remy [France] ; R. Schott [France] | A linear-time algorithm for the generation of trees |
| 000C97 | N. Creignou [France] ; M. Hermann [France] | Complexity of generalized satisfiability counting problems |
| 000D32 | J.-M. Gallone [France] ; F. Charpillet [France] ; F. Alexandre [France] | Anytime scheduling with neural networks |
| This area was generated with Dilib version V0.6.33. |  |