On the Complexity of Optimization Problems based on Compiled NNF Representations

Daniel Le Berre; Emmanuel Lonca; Pierre Marquis

Reports (Technical Report) Year : 2014

On the Complexity of Optimization Problems based on Compiled NNF Representations

(1) , (1) , (1)

1

Daniel Le Berre

Function : Author
PersonId : 2191
IdHAL : daniel-le-berre
ORCID : 0000-0003-3221-9923
IdRef : 152104046

Centre de Recherche en Informatique de Lens

CV

Emmanuel Lonca

Function : Author
PersonId : 179860
IdHAL : emmanuel-lonca
ORCID : 0000-0002-9502-2821

Centre de Recherche en Informatique de Lens

Pierre Marquis

Function : Author
PersonId : 747412
IdHAL : pierre-marquis
ORCID : 0000-0002-7979-6608
IdRef : 060756152

Centre de Recherche en Informatique de Lens

Domains

Computer Science [cs] Artificial Intelligence [cs.AI]

Fabien DELORME : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03296019

Submitted on : Thursday, July 22, 2021-3:21:28 PM

Last modification on : Wednesday, October 26, 2022-8:13:51 AM

Dates and versions

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

Identifiers

HAL Id : hal-03296019 , version 1

Cite

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

On the Complexity of Optimization Problems based on Compiled NNF Representations

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share