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

From MaRDI portal
Revision as of 12:41, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5092478

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)

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:5092478&oldid=19593401"
Powered by MediaWiki