polynomial-time

polynomial-time

(complexity)
(P) The set or property of problems which can be solved by a known polynomial-time algorithm.
References in periodicals archive ?
There is a probabilistic polynomial-time algorithm TrapGen(q,n) that outputs a pair ([mathematical expression not reproducible]) such that A is statistically close to a uniform matrix in [mathematical expression not reproducible] and S is a basis for [mathematical expression not reproducible] satisfying
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives.
We show that four natural variations of this intervention-planning problem are hard-to-approximate: no polynomial-time algorithms can exist without substantial compromise in the guaranteed quality of the solution.
If there is an algorithm that can solve 3-SAT in polynomial-time, then it would also be able to solve SUBSET-SUM in polynomial-time, contradicting Feinstein's lower-bound claim of [THETA]([square root of [2.
Let f be a polynomial-time transformation from a minimization optimization problem [PI] to a minimization optimization problem [PI], We say that f is an L-reduction if there are constants [alpha], [beta] > 0 such that for each instance I of [PI]:
In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant.
We first notice that this reduction is clearly polynomial-time.
Readers should have taken an introductory number theory course (though he reviews the necessary basics), be adept with calculus and linear algebra, be computer literate to the level of pseudocode and protocols, and be familiar with the notions of polynomial time and the non-deterministic polynomial-time class N P.
They proposed a polynomial-time dynamic programming algorithm for the problem with a given number of machines.
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs.
Correctness: A probabilistic polynomial-time joint Computation (P, V, M) has correctness if for any i [member of] [n] and any ([W.
Then the Quadratic Residue Assumption [3] states that there is no probabilistic polynomial-time algorithm for computing square roots with respect to modulus N.