Sökning: "Gustav Nordh"

Hittade 1 avhandling innehållade orden Gustav Nordh.

1. 1. Complexity Dichotomies for CSP-related Problems

   Författare :Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

   Sammanfattning : 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. LÄS MER