Computational complexity

There have been 3 topic suggestions tagged with computational complexity.

Related Tags

Talk Suggestions

P vs. NP

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

computability computational complexity computer science open problem theoretical computer science

Presburger Arithmetic

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

computability computational complexity computer science logic theoretical computer science

Unique Games Conjecture

The Unique Games Conjecture, if true, implies that many problems that lack exact polynomial time solutions also lack approximate polynomial time solutions. It was formulated by Subhash Khot in 2002 and is still unsolved.

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

computational complexity computer science open problem theoretical computer science