'''np''' problems believed '''np''' equal '''co np''' however yet proven clear two complexity classes equal '''p''' equal '''np''' since '''p''' '''co p''' thus '''p''' '''np''' would '''co p''' '''co np''' whence '''np''' '''p''' '''co p''' '''co np''' similarly known '''l''' set problems solved logarithmic space strictly contained '''p''' equal '''p''' many complexity classes two '''nl''' '''nc''' known
Formal science Computer science Theory of computation Computational complexity theory