Litcius/Paper detail

Fifty years of P vs. NP and the possibility of the impossible

Lance Fortnow

2021Communications of the ACM25 citationsDOIOpen Access PDF

Abstract

Advances in algorithms, machine learning, and hardware can help tackle many NP-hard problems once thought impossible.

Topics & Concepts

Computer scienceNP-completeArtificial intelligenceMachine learningComputational complexity theoryAlgorithmQuantum Computing Algorithms and ArchitectureComputability, Logic, AI AlgorithmsComplexity and Algorithms in Graphs
Fifty years of P vs. NP and the possibility of the impossible | Litcius