1. Function problemIn computational complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output is more complex than that of a decision problem, that is, it isn't just YES or NO. Notable examples include the travelling salesman problem, which asks for the route taken by the salesman, and the integer factorization problem, which asks for the list of factors.
Read “Function problem” on English Wikipedia
Read “関数問題” on Japanese Wikipedia
Read “Function problem” on DBpedia
Read “Function problem” on English Wikipedia
Read “関数問題” on Japanese Wikipedia
Read “Function problem” on DBpedia
Discussions
Log in to talk about this word.