多項式階層
1. Polynomial hierarchyIn computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines. It is a resource-bounded counterpart to the arithmetical hierarchy and analytical hierarchy from mathematical logic.
Read “Polynomial hierarchy” on English Wikipedia
Read “多項式階層” on Japanese Wikipedia
Read “Polynomial hierarchy” on DBpedia
Read “Polynomial hierarchy” on English Wikipedia
Read “多項式階層” on Japanese Wikipedia
Read “Polynomial hierarchy” on DBpedia
Discussions
Log in to talk about this word.