Open AccessThe (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
Author(s) -
Victor Lagerkvist,
Magnus Wahlström
Publication year - 2021
Publication title -
acm transactions on computation theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.973
H-Index - 17
eISSN - 1942-3462
pISSN - 1942-3454
DOI - 10.1145/3492336
Subject(s) - upper and lower bounds , constraint satisfaction problem , mathematics , satisfiability , combinatorics , connection (principal bundle) , context (archaeology) , discrete mathematics , time complexity , algebraic number , probabilistic logic , mathematical analysis , paleontology , statistics , geometry , biology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom