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 ?
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.
Also in [1], the authors presented a polynomial-time algorithm of to compute the coefficient functions of [Top.
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.
Given a RSA instance (N, e, c), the advantage for any probabilistic polynomial-time (PPT) adversary A, every positive polynomial P(*) and all sufficiently large k to solve the RSA problem is at most 1/P(k), i.
There is a new appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing.
In fact one can mention that the security of all public key cryptosystems and digital schemes depend on the fact that there are no known polynomial-time algorithms for Type [I.
And because there is no algorithm which solves SUBSET-SUM that runs in polynomial-time (since the Meet-in-the-Middle algorithm runs in exponential-time and is the fastest algorithm for solving SUBSET-SUM, as we have shown above), we say that the SUBSET-SUM problem is not in class P [5].
Computer science theoreticians and mathematicians have tried, but so far have been unable, to prove that the problems in the class NP are actually harder than the problems in the class P (those that have polynomial-time solutions).
Quite a number of problems are known to belong to NP that have no known polynomial-time algorithm capable of solving them.
Richard Karp is known for characterizing polynomial-time reducibility as the most important property of NP-complete problems.