1.Previous
3.Next

Leonid Levin, proved that there exist practically relevant problems that are NP-complete - a landmark result in computational complexity theory.

Modern theoretical computer science research is based on these basic developments, but includes many other mathematical and interdisciplinary problems that have been posed, as shown below:

Topics

Algorithms

An algorithm

1.Previous
3.Next