複雑性クラス
1. Complexity classIn computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using O(f) of resource R, where n is the size of the input.
Read “Complexity class” on English Wikipedia
Read “複雑性クラス” on Japanese Wikipedia
Read “Complexity class” on DBpedia
Read “Complexity class” on English Wikipedia
Read “複雑性クラス” on Japanese Wikipedia
Read “Complexity class” on DBpedia
Discussions
Log in to talk about this word.