P versus NP problem
id:
p-versus-np-problem-181-15499780
title:
P versus NP problem
text:
The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved. Here, quickly means an algorithm that solves the task and runs in polynomial time exists, meaning the task completion time is bounded above by a polynomial function on the size of the input to the algorithm. The general class of questions that some algorithm can answer in polynomial time is "P" or "class
brand slug:
wiki
category slug:
encyclopedia
description:
Unsolved problem in computer science
original url:
https://en.wikipedia.org/wiki/P_versus_NP_problem
date created:
2001-08-26T23:04:30Z
date modified:
2024-09-05T23:34:36Z
main entity:
{"identifier":"Q746242","url":"https://www.wikidata.org/entity/Q746242"}
image:
fields total:
13
integrity:
15