约 206,000 个结果
时间不限
在新选项卡中打开链接
- 查看更多前往 Wikipedia 查看全部内容
Promise problem - Wikipedia
In computational complexity theory, a promise problem is a generalization of a decision problem where the input is promised to belong to a particular subset of all possible inputs. Unlike decision problems, the yes instances (the inputs for which an algorithm must return yes) and no instances do not exhaust the set … 展开
Many natural problems are actually promise problems. For instance, consider the following problem: Given a directed acyclic graph, determine if the graph has a path of length 10. The yes instances are directed acyclic graphs … 展开
CC-BY-SA 许可证中的维基百科文本 承诺问题 - 维基百科,自由的百科全书 - zh.wikipedia.org
承諾問題 - 维基百科,自由的百科全书
Futures and promises - Wikipedia
承諾問題 - 維基百科,自由的百科全書 - zh.wikipedia.org
Promise problem - Wikiwand
BQP - Wikipedia
网页Promise-BQP is the class of promise problems that can be solved by a uniform family of quantum circuits (i.e., within BQP). [10] Completeness proofs focus on this version of BQP.
承诺问题 - 百度百科
About: Promise problem - DBpedia Association
On Promise Problems: A Survey - SpringerLink