Complexity Theory

Computational Complexity Theory

Complexity theory

Concerns:

  • Computationally hard and easy problems, P vs NP. Is P = NP?

  • Classifying problems according to their complexity

  • Rigorous proof that a NP problem is NP indeed

PreviousAlgorithmic ComplexityNextdebrief-name: math section-code: 900 section-name: aggregations section-desc: Aggregations, indices,

Last updated