Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Marvin Künnemann, Dániel Marx

Journal title: Proceedings of the Computational Complexity Conference 2020

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020

Published year: 2020

Published pages: 27:1-27:28

DOI identifier: 10.4230/lipics.ccc.2020.27

ISBN: 978-3-95977-156-6