| slovo | definícia |
polynomial
(encz) | polynomial,mnohočlen n: [mat.] |
polynomial
(encz) | polynomial,polynom n: [mat.] |
polynomial
(encz) | polynomial,polynomický adj: Zdeněk Brož |
Polynomial
(gcide) | Polynomial \Pol`y*no"mi*al\, n. [Poly- + -nomial, as in
monomial, binomial: cf. F. polyn[^o]me.] (Alg.)
An expression composed of two or more terms, connected by the
signs plus or minus; as, a^2 - 2ab + b^2.
[1913 Webster] |
Polynomial
(gcide) | Polynomial \Pol`y*no"mi*al\, a.
1. Containing many names or terms; multinominal; as, the
polynomial theorem.
[1913 Webster]
2. Consisting of two or more words; having names consisting
of two or more words; as, a polynomial name; polynomial
nomenclature.
[1913 Webster] |
polynomial
(wn) | polynomial
adj 1: having the character of a polynomial; "a polynomial
expression" [syn: polynomial, multinomial]
n 1: a mathematical function that is the sum of a number of
terms [syn: polynomial, multinomial] |
polynomial
(foldoc) | polynomial
1. An arithmetic expression composed by summing
multiples of powers of some variable.
P(x) = sum a_i x^i for i = 0 .. N
The multipliers, a_i, are known as "coefficients" and N, the
highest power of x with a non-zero coefficient, is known as
the "degree" of the polynomial. If N=0 then P(x) is constant,
if N=1, P(x) is linear in x. N=2 gives a "quadratic" and
N=3, a "cubic".
2. polynomial-time.
|
| | podobné slovo | definícia |
characteristic polynomial
(encz) | characteristic polynomial,charakteristický polynom [mat.] det(lambda*I -
A) v.martin |
degree of a polynomial
(encz) | degree of a polynomial, n: |
monic polynomial
(encz) | monic polynomial, n: |
polynomial degree
(encz) | polynomial degree,stupeň polynomu [mat.] v.martin |
polynomially
(encz) | polynomially, |
polynomials
(encz) | polynomials,mnohočleny n: pl. Zdeněk Brožpolynomials,polynomy n: pl. Zdeněk Brož |
quartic polynomial
(encz) | quartic polynomial, n: |
univariate polynomial
(encz) | univariate polynomial,polynom jedné proměnné [mat.] x^3 + 2*x^2 + 5*x +
2 v.martin |
Polynomial
(gcide) | Polynomial \Pol`y*no"mi*al\, n. [Poly- + -nomial, as in
monomial, binomial: cf. F. polyn[^o]me.] (Alg.)
An expression composed of two or more terms, connected by the
signs plus or minus; as, a^2 - 2ab + b^2.
[1913 Webster]Polynomial \Pol`y*no"mi*al\, a.
1. Containing many names or terms; multinominal; as, the
polynomial theorem.
[1913 Webster]
2. Consisting of two or more words; having names consisting
of two or more words; as, a polynomial name; polynomial
nomenclature.
[1913 Webster] |
biquadratic polynomial
(wn) | biquadratic polynomial
n 1: a polynomial of the fourth degree [syn: biquadratic,
biquadratic polynomial, quartic polynomial] |
degree of a polynomial
(wn) | degree of a polynomial
n 1: the degree of the term in the polynomial that has the
highest degree |
homogeneous polynomial
(wn) | homogeneous polynomial
n 1: a polynomial consisting of terms all of the same degree |
monic polynomial
(wn) | monic polynomial
n 1: a polynomial in one variable |
quadratic polynomial
(wn) | quadratic polynomial
n 1: a polynomial of the second degree [syn: quadratic,
quadratic polynomial] |
quartic polynomial
(wn) | quartic polynomial
n 1: a polynomial of the fourth degree [syn: biquadratic,
biquadratic polynomial, quartic polynomial] |
complementary nondeterministic polynomial
(foldoc) | complementary nondeterministic polynomial
Co-NP
(Co-NP) The set (or property) of problems with a
yes/no answer where the complementary no/yes problem takes
nondeterministic polynomial time (NP).
For example, "Is n prime" is Co-NP and "Is n not prime" is NP,
since it is only necessary to find one factor to prove that
n is not prime whereas to prove that it is prime all possible
factors must be eliminated.
(2009-05-21)
|
non-polynomial
(foldoc) | non-polynomial
The set or property of problems for which no
polynomial-time algorithm is known.
This includes problems for which the only known algorithms
require a number of steps which increases exponentially with
the size of the problem, and those for which no algorithm at
all is known. Within these two there are problems which are
"provably difficult" and "provably unsolvable".
(1995-04-10)
|
nondeterministic polynomial time
(foldoc) | nondeterministic polynomial time
NP time
(NP) A set or property of computational {decision
problems} solvable by a nondeterministic Turing Machine in a
number of steps that is a polynomial function of the size of
the input. The word "nondeterministic" suggests a method of
generating potential solutions using some form of
nondeterminism or "trial and error". This may take
exponential time as long as a potential solution can be
verified in polynomial time.
NP is obviously a superset of P (polynomial time problems
solvable by a deterministic Turing Machine in {polynomial
time}) since a deterministic algorithm can be considered as a
degenerate form of nondeterministic algorithm. The question
then arises: is NP equal to P? I.e. can every problem in NP
actually be solved in polynomial time? Everyone's first guess
is "no", but no one has managed to prove this; and some very
clever people think the answer is "yes".
If a problem A is in NP and a polynomial time algorithm for A
could also be used to solve problem B in polynomial time, then
B is also in NP.
See also Co-NP, NP-complete.
[Examples?]
(1995-04-10)
|
polynomial-time
(foldoc) | polynomial-time
(P) The set or property of problems which can be
solved by a known polynomial-time algorithm.
(1995-04-10)
|
polynomial-time algorithm
(foldoc) | polynomial-time algorithm
A known algorithm (or Turing Machine) that is
guaranteed to terminate within a number of steps which is a
polynomial function of the size of the problem.
See also computational complexity, exponential time,
nondeterministic polynomial-time (NP), NP-complete.
(1995-04-13)
|
|