Nonelementary problem
In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY.
Examples of nonelementary problems that are nevertheless decidable include:
网站首页 情感咨询 情感美文 情感百科 情感生活 学习充电 旧版美文
依恋情感网英汉例句词典收录3870147条英语例句词条，基本涵盖了全部常用英语单词的释义及例句，是英语学习的有利工具。