Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction

DOI10.4230/LIPICS.CCC.2020.27OpenAlexW3044778046MaRDI QIDQ5092478

Author name not available (Why is that?)

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/2005.11541

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092478)