Warning:
JavaScript is turned OFF. None of the links on this page will work until it is reactivated.
If you need help turning JavaScript On, click here.
This Concept Map, created with IHMC CmapTools, has information related to: ComplexityTheory, Complexity Classes e. g. Class NC (Nick's Class), Class NP are verified by a Deterministic Decider, Class NP are verified in Polynomial Time, Class P-Complete is a (proper?) subset of Class P, Computational Resources such as Space, Cook-Levin Theorem is a fundamental theorem in Computability Complexity Theory, Complexity Classes e. g. Class P, Computability Complexity Theory uses concepts from Computability Theory, Complexity Classes e. g. Class NP-Complete, Class NP are solved nondeterministically in Polynomial Time, Class P-Complete e. g. CIRCUIT VALUE, Computability Complexity Theory analyzes Computational Difficulty, Class PSPACE use unlimited Time, Turing Machine can be a Deterministic Turing Machine, Turing Machine requires Computational Resources, Computability Theory is an area of Theory of Computation, Complexity Classes is a set of Decidable Languages, Class P e. g. RELPRIME, Class P are solved by a Deterministic Decider, Time is defined as Polynomial Time