Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01192908
Contributor : Nadia Creignou <>
Submitted on : Thursday, September 3, 2015 - 6:47:33 PM
Last modification on : Monday, March 4, 2019 - 2:04:14 PM

Identifiers

  • HAL Id : hal-01192908, version 1

Collections

Citation

Nadia Creignou, Heribert Vollmer. Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2015, 136 (4), pp.297-316. ⟨hal-01192908⟩

Share

Metrics

Record views

95