Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00682223n
Noun Concept
JA
探索問題
EN
In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. Wikipedia
Relations
Sources
IS A
計算問題
Wikidata
JA
探索問題
Wikipedia Translations
JA
探索問題

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License