"Finding Small Satisfying Assignments Faster Than Brute Force: A ..."

Marvin Künnemann, Dániel Marx (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2020.27

access: open

type: Conference or Workshop Paper

metadata version: 2023-02-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/KunnemannM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/KunnemannM20
Marvin Künnemann, Dániel Marx:
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. CCC 2020: 27:1-27:28

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.