Details
| Originalsprache | undefiniert/unbekannt |
|---|---|
| Seiten (von - bis) | 297-316 |
| Fachzeitschrift | Fundam. Informaticae |
| Jahrgang | 136 |
| Ausgabenummer | 4 |
| Publikationsstatus | Veröffentlicht - 2015 |
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Fundam. Informaticae, Jahrgang 136, Nr. 4, 2015, S. 297-316.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Parameterized Complexity of Weighted Satisfiability Problems - Decision, Enumeration, Counting.
AU - Creignou, Nadia
AU - Vollmer, Heribert
N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2015
Y1 - 2015
U2 - 10.3233/FI-2015-1159
DO - 10.3233/FI-2015-1159
M3 - Article
VL - 136
SP - 297
EP - 316
JO - Fundam. Informaticae
JF - Fundam. Informaticae
IS - 4
ER -