- 查看更多
前往 Wikipedia 查看全部内容Polynomial-time reduction | Wikipedia
In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another. One shows that if a hypothetical subroutine solving the second problem exists, then the first problem can be solved by transforming or reducing it to inputs for the second problem and … 展开
The three most common types of polynomial-time reduction, from the most to the least restrictive, are polynomial-time many-one reductions, truth-table reductions, and 展开
A complete problem for a given complexity class C and reduction ≤ is a problem P that belongs to C, such that every problem A in C has a reduction A ≤ … 展开
The definitions of the complexity classes NP, PSPACE, and EXPTIME do not involve reductions: reductions come into their study only in the … 展开
CC-BY-SA 许可证中的维基百科文本 Polynomial-time counting reduction | Wikipedia
In the computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction (a transformation from one problem to another) used to define the notion of completeness for the complexity class ♯P. These reductions may also be called polynomial many-one counting reductions or weakly parsimonious reductions; they are analogous to many-one reductions for decision problems and they generalize the parsimonious reductions.
Wikipedia · CC-BY-SA 许可下的文字- 预计阅读时间：3 分钟
Reduction (complexity) | Wikipedia
网页When studying the complexity class NP and harder classes such as the polynomial hierarchy, polynomial-time reductions are used. When studying classes within P such …
- 预计阅读时间：9 分钟
网页Polynomial-Time Reduction Purpose. Classify problems according to relative difficulty. Design algorithms. If X ≤P Y and Y can be solved in polynomial-time, then X …
多項式時間 - 維基百科，自由的百科全書 | zh.wikipedia.org
网页多項式時間（英語： Polynomial time ）在計算複雜度理論中，指的是一個問題的計算時間 不大於問題大小 的多項式倍數。 任何抽象機器都擁有一 複雜度類 ，此類包括可於此機器 …
- 预计阅读时间：3 分钟
Introduction to Theoretical Computer Science: …
网页A polynomial-time reduction (or sometimes just “reduction” for short) from \ (F\) to \ (G\) is a way to show that \ (F\) is “no harder” than \ (G\), in the sense that a polynomial-time algorithm for \ (G\) implies a polynomial …
多项式时间 - 维基百科，自由的百科全书 | zh.wikipedia.org
网页多项式时间（英语： Polynomial time ）在计算复杂度理论中，指的是一个问题的计算时间 不大于问题大小 的多项式倍数。 任何抽象机器都拥有一 复杂度类 ，此类包括可于此机器 …
Polynomial-Time Reduction | Computer Science Stack Exchange
网页2018年6月2日 · In the vaguest sense you can think of a polynomial time reduction as a reduction that requires $O(n^k)$ steps (for a fixed k). So we require polynomial time in …
网页Polynomial-time Reduction A polynomial time reduction from a decision problem X to a decision problem Y is an algorithm A that has the following properties: given an instance …
NP-hardness | Wikipedia
网页In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a …
Polynomial time reduction wikipedia 的相关搜索
跳至内容
