Computer Science/Discrete Mathematics

Error correcting codes are objects designed to withstand errors that may arise during communication. Originally intended for practical use, codes have come to be established as one of the central objects of study in theoretical computer science, due...

The satisfiability problem for Constraint Satisfaction Problems (CSPs) asks whether an instance of a CSP has a fully satisfying assignment, i.e., an assignment that satisfies all constraints. This problem is known to be in class P or is NP-complete...