対数領域還元
1. Log-space reductionIn computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually, this means it can keep a constant number of pointers into the input, along with a logarithmic number of fixed-size integers. Since such a machine has polynomially-many configurations, log-space reductions are also polynomial-time reductions.
Read “Log-space reduction” on English Wikipedia
Read “対数領域還元” on Japanese Wikipedia
Read “Log-space reduction” on DBpedia
Read “Log-space reduction” on English Wikipedia
Read “対数領域還元” on Japanese Wikipedia
Read “Log-space reduction” on DBpedia
Discussions
Log in to talk about this word.