Jisho

×
多項式時間変換
Links
Wikipedia definition
1. Polynomial-time reduction​In computational complexity theory a polynomial-time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many-one reduction, it is called a polynomial-time many-one reduction, polynomial transformation, or Karp reduction. If it is a Turing reduction, it is called a polynomial-time Turing reduction or Cook reduction.
Read “Polynomial-time reduction” on English Wikipedia
Read “多項式時間変換” on Japanese Wikipedia
Read “Polynomial-time reduction” on DBpedia

Discussions

to talk about this word.