0
Still curious? Ask our experts.
Chat with our AI personalities
Professor
Blake
LaoAdd your answer:
Earn +20 pts
What is the difference between polynomial and non polynomial time complexity?
Polynomial vs non polynomial time complexity
Is this a polynomial or binomial or trinomial 4x2?
It is a polynomial (monomial). It is a polynomial (monomial). It is a polynomial (monomial). It is a polynomial (monomial).
What is the difference between exponential and polynomial time complexity?
Algorithms which have exponential time complexity grow much faster than polynomial algorithms. The difference you are probably looking for happens to be where the variable is in the equation that expresses the run time. Equations that show a polynomial time complexity have variables in the bases of their terms. Examples: n^3 + 2n^2 + 1. Notice n is in the base, NOT the exponent. In exponential equations, the variable is in the exponent. Examples: 2^n. As said before, exponential time grows much faster. If n is equal to 1000 (a reasonable input for an algorithm), then notice 1000^3 is 1 billion, and 2^1000 is simply huge! For a reference, there are about 2^80 hydrogen atoms in the sun, this is much more than 1 billion.
Is a log of a polynomial still a polynomial?
No.
How alike the polynomial and non polynomial?
"Non-polynomial" can mean just about anything... How alike it is with the polynomial depends on what specifically you choose to include.
