On the Complexity of Optimization Problems based on Compiled NNF Representations - Archive ouverte HAL Access content directly
Reports (Technical Report) Year : 2014

On the Complexity of Optimization Problems based on Compiled NNF Representations

(1) , (1) , (1)
1
Not file

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⟩
12 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More