2004•Lecture notes in computer scienceRequires access
An Extensible SAT-solver
Niklas Eén, Niklas Sörensson
Open publisher page 2,623 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Niklas Eén, Niklas Sörensson
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 2623 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Computer science, Solver, Problem solver, Boolean satisfiability problem, Construct (python library), Domain (mathematical analysis), Programming language, Theoretical computer science