Latest in Theoretical Computer Science

Theoretical Computer Science

The mathematics of computing: algorithms, computational complexity, the limits of computation and quantum algorithms.

  • 2 Subtopics
  • 27 Tracked terms
  • Last 30 days Feed window

Inside Theoretical Computer Science

Complexity & P vs NP Computational complexity: P vs NP, hardness results, the exponential time hypothesis and lower bounds on classical and quantum computation.
Quantum Algorithms Quantum algorithms and codes as mathematics: Shor's and Grover's algorithms, quantum walks and the quantum error-correcting codes behind fault tolerance.

What this topic collects on

An article joins this feed when it matches these terms. Each one is also a search of its own.