claim: Edouard Seguin is remembered for his work with adults.
evidence: In computational complexity theory , a branch of computer science , the Max / min CSP / Ones classification theorems state necessary and sufficient conditions that determine the complexity classes of problems about satisfying a subset S of boolean relations .. computational complexity theory. computational complexity theory. computer science. computer science. They are similar to Schaefer 's dichotomy theorem , which classifies the complexity of satisfying finite sets of relations ; however , the Max / min CSP / Ones classification theorems give information about the complexity of approximating an optimal solution to a problem defined by S.. approximating. approximation algorithm. Given a set S of clauses , the Max constraint satisfaction problem -LRB- CSP -RRB- is to find the maximum number of satisfiable -LRB- possibly weighted -RRB- clauses in S. Similarly , the Min CSP problem is to minimize this number of clauses .. The Max Ones problem is to maximize the number of boolean variables in S that are set to 1 when all clauses are satisfied , and the Min Ones problem is to minimize this number .. When using the classifications below , the problem 's complexity class is determined by the topmost classification that it satisfies .