Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03506566n
Noun Named Entity
Categories: Complexity classes
EN
P  AL  complexity class P  Nonuniform Polynomial-Time  Nonuniform polynomial time
EN
In computational complexity theory, P, also known as PTIME or DTIME, is a fundamental complexity class. Wikipedia
English:
complexity
class
complexity class
Definitions
Relations
Sources
EN
In computational complexity theory, P, also known as PTIME or DTIME, is a fundamental complexity class. Wikipedia
A complexity class in computational complexity theory Wikipedia Disambiguation
A computational complexity class Wikipedia Disambiguation
Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time Wikidata
IS A
complexity class
computational problem
HAS PART
NC
TC
P-complete
AC
CC
PART OF
P/poly
UP
Randomized polynomial time
co-NP
HAS KIND
predicate
Wikipedia
EN
P (complexity)
Wikidata
EN
P
Wikipedia Redirections
EN
AL (complexity), complexity class P, Nonuniform Polynomial-Time, Nonuniform polynomial time, P-hard, P (class), PTIME
Wikidata Alias
EN
P class, polynomial time, polynomial time class, PTIME

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License