Best-case and worst-case sparsifiability of Boolean CSPs
From MaRDI portal
Publication:786033
DOI10.1007/S00453-019-00660-YzbMATH Open1452.68176OpenAlexW3000512743MaRDI QIDQ786033
Author name not available (Why is that?)
Publication date: 12 August 2020
Published in: (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10216/
No records found.
No records found.
This page was built for publication: Best-case and worst-case sparsifiability of Boolean CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786033)