Addressing the Complexity of Computation
Abstract
Lance Fortnow on the current status and future outlook of solving the P-NP problem.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Computability
Logic
AI Algorithms
Advanced Graph Theory Research
Publication details
- Journal / source
- Communications of the ACM
- Volume
- 69
- Issue
- 3
- Pages
- 108–108
- Publication date
- 12 February 2026
- Language
- EN