Problème NP complet And NotRodolphe Giroudeau
List of bibliographic references
Number of relevant bibliographic references: 6.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000515 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Closure properties and decision problems of dag automata |
| 000680 | Michaël Rusinowitch [France] ; Mathieu Turuani [France] | Protocol insecurity with a finite number of sessions and composed keys is NP-complete |
| 000878 | Alessandro Armando [Italie] ; Felice Peccia [Italie] ; Silvio Ranise [Italie, France] | The Phase transition of the linear inequalities problem |
| 000990 | P. De Groote [France] | Linear higher-order matching is NP-complete |
| 000A70 | A. Durand [France] ; M. Hermann [France] ; L. Juban [France] | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
| 000A90 | L. Juban [France] | Dichotomy theorem for the generalized unique satisfiability problem |
| This area was generated with Dilib version V0.6.33. |  |