Sparsification of SAT and CSP Problems via Tractable Extensions
Work
Year: 2020
Type: article
Abstract: Unlike polynomial kernelization in general, for which many non-trivial results and methods exist, only few non-trival algorithms are known for polynomial-time sparsification. Furthermore, excepting pr... more
Authors Victor Lagerkvist, Magnus Wahlström
Institutions Linköping University, Royal Holloway University of London
Cites: 35
Cited by: 6
Related to: 10
FWCI: 0.569
Citation percentile (by year/subfield): 74.66
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green