We prove that each element of a class of functions (denoted by NPC t P), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if γ-reducibility is equivalent to ... TJ Long - 《Theoretical Computer Science》 被引量...
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time - Chistov - 1986 () Citation Context ...mputation of greatest common divisors of polynomials, the resolution of 478 Ali Ayad algebraic systems of polynomial equations and the ...
Afterwards, inspired by the polynomial time difference of convex functions (POTDC) method, we develop a sub-optimal solution which has lower complexity but... J Zhang,F Roemer,M Haardt - Proc 46-th Asilomar Conf on Signals, Systems, & Computers 被引量: 15发表: 2013年 Characterizing Polynom...
Polynomial Time Computations in Models of ET 来自 Semantic Scholar 喜欢 0 阅读量: 26 作者: D Joseph 摘要: This paper investigates formal notions of computation in nonstandard models of the weak arithmetic theory ET—the theory of exponential time. It is shown that ET is sufficiently weak ...
Non-intrusive polynomial chaos expansion Assume a probability space , where Ω is an event space, is a σ-algebra on Ω and is a probability measure on . If the Doob-Dynkin lemma is satisfied and the input variable of a mathematical model, , is a random variable , the model response is...
open shop schedulingmixed shop schedulingcomputational complexitypolynomial time algorithmNP-hard problemThe paper surveys the complexity results for job shop, ... P Brucker,NS Yu,F Werner - 《Mathematical Methods of Operations Research》 被引量: 61发表: 2007年 An FPTAS for scheduling a two-machine...
Polynomial time approximation schemes for dense instances of NP-hard problems We present a unified framework for designing polynomial time approximation schemes (PTASs) for "dense" instances of many ja:math ja:math -hard optimizati... S Arora,D Karger,M Karpinski - Twenty-seventh Acm Symposium ...
We now show that the following three conditions hold; otherwise we can constructively obtain a longer cycle in polynomial time. We then start the argument again with the new longer cycle. (1) There exists no (vr+,vs+)-path which is internally disjoint from C; in particular, vr+vs+∉E...
In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a
'', while this week I will be answering the related question of ``How can we interpretNPas the set of theorems whose proofs can be checked in polynomial time?''. 这个问题在很大程度上是前一个问题的后续问题。上周,Guy 回答了“复杂性类NP是什么意思”的问题,而本周我将回答“我们如何解释NP为...