Structural complexity theory
From Wikipedia, the free encyclopedia
This article is about the area in computer science. For the area in applied mathematics, see Structural complexity (applied mathematics).
In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of various complexity classes and the relations between different complexity classes.[1]