Go to the corresponding LIPIcs Volume Portal 
Künnemann, Marvin ; Marx, Dániel
pdfformat: 

@InProceedings{knnemann_et_al:LIPIcs:2020:12579, author = {Marvin K{\"u}nnemann and D{\'a}niel Marx}, title = {{Finding Small Satisfying Assignments Faster Than Brute Force: A FineGrained Perspective into Boolean Constraint Satisfaction}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {27:127:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771566}, ISSN = {18688969}, year = {2020}, volume = {169}, editor = {Shubhangi Saraf}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12579}, URN = {urn:nbn:de:0030drops125791}, doi = {10.4230/LIPIcs.CCC.2020.27}, annote = {Keywords: Finegrained complexity theory, algorithmic classification theorem, multivariate algorithms and complexity, constraint satisfaction problems, satisfiability} }
Keywords:  Finegrained complexity theory, algorithmic classification theorem, multivariate algorithms and complexity, constraint satisfaction problems, satisfiability  
Collection:  35th Computational Complexity Conference (CCC 2020)  
Issue Date:  2020  
Date of publication:  17.07.2020 