Sparsification of SAT and CSP Problems via Tractable Extensions

Research output: Contribution to journal › Article › peer-review

68 Downloads (Pure)

Original language	English
Article number	13
Pages (from-to)	1-29
Number of pages	29
Journal	ACM Transactions on Computation Theory (TOCT)
Volume	12
Issue number	2
DOIs	https://doi.org/10.1145/3389411
Publication status	Published - 26 Apr 2020

Access to Document

@article{8d74265b133e428d9908875e2030611c,

title = "Sparsification of SAT and CSP Problems via Tractable Extensions",

author = "Victor Lagerkvist and Magnus Wahlstrom",

year = "2020",

month = apr,

day = "26",

doi = "10.1145/3389411",

language = "English",

volume = "12",

pages = "1--29",

journal = "ACM Transactions on Computation Theory (TOCT)",

issn = "1942-3454",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Sparsification of SAT and CSP Problems via Tractable Extensions

AU - Lagerkvist, Victor

AU - Wahlstrom, Magnus

PY - 2020/4/26

Y1 - 2020/4/26

U2 - 10.1145/3389411

DO - 10.1145/3389411

M3 - Article

SN - 1942-3454

VL - 12

SP - 1

EP - 29

JO - ACM Transactions on Computation Theory (TOCT)

JF - ACM Transactions on Computation Theory (TOCT)

IS - 2

M1 - 13

ER -