Advanced search
Found 1 swedish dissertation matching the above criteria.
-
1. Complexity Dichotomies for CSP-related Problems
Abstract : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. READ MORE
Result pages:
1