P vs NP: An Introduction to Complexity Theory

Read full text Summarise with VIRAT
Authors: Shae McKenna
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

A literature review on Computational Complexity Theory's P vs NP Millennium Problem

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Computability Logic AI Algorithms

Publication details

Journal / source
Figshare
Publication date
1 January 2026
Language
EN