Best-case and worst-case sparsifiability of Boolean CSPs

From MaRDI portal
Publication:786033

DOI10.1007/s00453-019-00660-yzbMath1452.68176OpenAlexW3000512743MaRDI QIDQ786033

Bart M. P. Jansen, Hubie Chen, Astrid Pieterse

Publication date: 12 August 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10216/




Related Items (5)



Cites Work


This page was built for publication: Best-case and worst-case sparsifiability of Boolean CSPs