Please enable JavaScript.

Coggle requires JavaScript to display documents.

P, NP and NP-Complete Problems - Coggle Diagram

- - - - Is P a proper subset of NP, or are these two classes, in fact, the same?
    - - A decision problem D is said to be NP-complete if
        
        It belongs to class NP
        
        Every problem in NP is polynomially reducible to
        
        A decision problem D1 is said to be polynomially reducible to
        a decision problem D2 , if there exists a function t that transforms instances of D1 to instances of D2 such that:
        
        t maps all yes instances of D1 to yes instances of D2 and all no instances of D1
        to no instances of D2
        
        t is computable by a polynomial time algorithm