On the Complexity of Optimization Problems based on Compiled NNF Representations - Université d'Artois Accéder directement au contenu
Rapport (Rapport Technique) Année : 2014

On the Complexity of Optimization Problems based on Compiled NNF Representations

Fichier non déposé

Dates et versions

hal-03296019 , version 1 (22-07-2021)

Identifiants

  • HAL Id : hal-03296019 , version 1

Citer

Daniel Le Berre, Emmanuel Lonca, Pierre Marquis. On the Complexity of Optimization Problems based on Compiled NNF Representations. [Technical Report] CRIL. 2014. ⟨hal-03296019⟩
23 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More