Temps polynomial And NotDamien Stehle
List of bibliographic references
Number of relevant bibliographic references: 29.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000102 | Vincent Boudht [France] ; Johanne Cohhn [France] ; Rodolphe Giroudeau [France] ; Jean-Clalide Könic [France] | SCHEDULING IN THE PRESENCE OF PROCESSOR NETWORKS: COMPLEXITY AND APPROXIMATION |
| 000135 | Mouhebeddine Berrima [Tunisie] ; Narjes Ben Rajeb [Tunisie] ; Véronique Cortier [France] | DECIDING KNOWLEDGE IN SECURITY PROTOCOLS UNDER SOME E-VOTING THEORIES |
| 000229 | A. Bellanger [France] ; A. Oulamara [France] | Scheduling hybrid flowshop with parallel batching machines and compatibilities |
| 000276 | Jérome Besombes [France] ; Jean-Yves Marion [France] | LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES |
| 000285 | Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France] | A Logical Account of PSPACE |
| 000347 | Yuri N. Sotskov [Biélorussie] ; Alexandre Dolgui [France] ; Marie-Claude Portmann [France] | Stability analysis of an optimal balance for an assembly line with fixed cycle time |
| 000361 | Mikhail Y. Kovalyov [Biélorussie] ; Marie-Claude Portmann [France] ; Ammar Oulamara [France] | Optimal testing and repairing a failed series system |
| 000362 | Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggemes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France] | Optimal linear arrangement of interval graphs |
| 000376 | Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France] | Implicit complexity over an arbitrary structure : Quantifier alternations |
| 000396 | Manin Abadi [États-Unis] ; Véronique Cortier [France] | Deciding knowledge in security protocols under equational thoories |
| 000464 | Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Vitaly Shmatikov [États-Unis] ; Mathieu Turuani [France] | Probabilistic polynomial-time semantics for a protocol security logic |
| 000507 | Véronique Cortier [France] ; Bogdan Warinschi [États-Unis] | Computationally sound, automated proofs for security protocols |
| 000515 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Closure properties and decision problems of dag automata |
| 000568 | Yves Lafont [France] | Soft linear logic and polynomial time |
| 000584 | L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne] | On the computational complexity of imperative programming languages |
| 000591 | N. Danner [États-Unis] ; C. Pollett [États-Unis] | Minimization and NP multifunctions |
| 000617 | Martin Abadi [États-Unis] ; Veronique Cortier [France] | Deciding knowledge in security protocols under equational theories |
| 000629 | Klaus Aehlig [Allemagne] ; Ulrich Berger [Royaume-Uni] ; Martin Hofinann [Allemagne] ; Helmut Schwichtenberg [Allemagne] | An arithmetic for non-size-increasing polynomial-time computation |
| 000685 | F. Laroussinie [France] ; Ph. Schnoebelen [France] ; M. Turuani [France] | On the expressivity and complexity of quantitative branching-time temporal logics |
| 000723 | J. Y. Marion [France] | Analysing the implicit complexity of programs |
| 000724 | Jean-Charles Faugere [France] ; Antoine Joux [France] | Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases |
| 000777 | Philippe Duchon [France] ; Philippe Flajolet [France] ; Guy Louchard [Belgique] ; Gilles Schaeffer [France] | Random sampling from Boltzmann principles |
| 000921 | Jean-Yves Marion [France] | Actual arithmetic and feasibility |
| 000959 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| 000975 | Philippe De Groote [France] | Proof-search in implicative linear logic as a matching problem |
| 000A06 | Jean-Yves Marion [France] ; J.-Y. Moyen [France] | Efficient first order functional program interpreter with time bound certifications |
| 000A90 | L. Juban [France] | Dichotomy theorem for the generalized unique satisfiability problem |
| 000C74 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| 000C97 | N. Creignou [France] ; M. Hermann [France] | Complexity of generalized satisfiability counting problems |
| This area was generated with Dilib version V0.6.33. |  |