In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a definition of the form:the set of problems that can be solved by an abstract machine M using O(f(n)) of resource R, where n is the size of the input.Complexity classes are concerned with the rate of growth of the requirement in resources as the input n increases.