Given an oracle for Z, can solve instance of X: – run the algorithm for X using a oracle for Y – each time oracle for Y is called, simulate it in a polynomial number of steps by using algorithm for Y, plus oracle calls to Z s s s 3 4 Polynomial-Time Reduction Basic strategies...
Polynomial-Time Reduction
Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduced to an equivalent instance with size upper-bounded by a function of a parameter chosen in advance. Kernelization for ...
Secondly, we prove that reachability and deadlock are polynomially-time equivalent; this improves the known recursive reduction and it complements the result of Cheng and al. [4]. Moreover, we show the polynomial equivalence of liveness and t-liveness. Hence, we regroup the problems in three...
必应词典为您提供polynomial-time-Turing-reduction的释义,网络释义: 多项式时间图灵归约;多项式时间图灵变换;
A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization 来自 IEEEXplore 喜欢 0 阅读量: 57 作者: E Kaltofen 摘要: An algorithm is presented which reduces the problem of finding the irreducible factors of a bivariate polynomial with integer coefficients in polynomial ...
I am trying to show a decision problem is NP-complete, using a polynomial-time reduction. As this is a homework question I won't post the exact question but the gist is this: "Let k∈Nk∈N. Let SS be a set of natural numbers, and Si⊂SSi⊂S a collection of subsets, each giv...
Our main focus is on the design of efficient self-reduction strategies, with combinatorial problems drawn from a variety of areas. 展开 DOI: 10.1080/00207168908803783 年份: 1989 收藏 引用 批量引用 报错 分享 全部来源 求助全文 Taylor & Francis 相似文献 参考文献 引证文献Comparison of polynomial-time...
polynomial time reduction L’(扛,则L就是节中(在多项式时间图灵归约下)“最困难”的,称其为够T-完全的。多项式时间图灵归约又称为库克归约。由多项式时间图灵归约的定义,很自然地可产生另一种重要的多项式时间归约,即多项式时间非确定图灵归约。多项式时间图灵归约与多项式时间非确定图灵归约的区别仅在于前者使...
polynomial time reduction L’(扛,则L就是节中(在多项式时间图灵归约下)“最困难”的,称其为够T-完全的。多项式时间图灵归约又称为库克归约。由多项式时间图灵归约的定义,很自然地可产生另一种重要的多项式时间归约,即多项式时间非确定图灵归约。多项式时间图灵归约与多项式时间非确定图灵归约的区别仅在于前者使...