Question

What is considered polynomial time?

Answer 1

ᵃⁿ ᵃˡᵍᵒʳⁱᵗʰᵐ ⁱˢ ˢᵃⁱᵈ ᵗᵒ ᵇᵉ ᵒᶠ ᵖᵒˡʸⁿᵒᵐⁱᵃˡ ᵗⁱᵐᵉ ⁱᶠ ⁱᵗˢ ʳᵘⁿⁿⁱⁿᵍ ᵗⁱᵐᵉ ⁱˢ ᵘᵖᵖᵉʳ ᵇᵒᵘⁿᵈᵉᵈ ᵇʸ ᵃ ᵖᵒˡʸⁿᵒᵐⁱᵃˡ ᵉˣᵖʳᵉˢˢⁱᵒⁿ ⁱⁿ ᵗʰᵉ ˢⁱᶻᵉ ᵒᶠ ᵗʰᵉ ⁱⁿᵖᵘᵗ ᶠᵒʳ ᵗʰᵉ ᵃˡᵍᵒʳⁱᵗʰᵐ, ⁱ.ᵉ., ᵗ(ⁿ) = ᵒ(ⁿᵏ) ᶠᵒʳ ˢᵒᵐᵉ ᵖᵒˢⁱᵗⁱᵛᵉ ᶜᵒⁿˢᵗᵃⁿᵗ ᵏ.

ʰᵒᵖᵉ ᵗʰⁱˢ ʷⁱˡˡ ʰᵉˡᵖ ᵘ ᵈᵉᵃʳ ᵇʳᵒ......✌✌✌

Answer 2

Answer:An algorithm is polynomial (has polynomial running time) if for some k,C>0, its running time on inputs of size n is at most Cnk. Equivalently, an algorithm is polynomial if for some k>0, its running time on inputs of size n is O(nk). This includes linear, quadratic, cubic and more. On the other hand, algorithms with exponential running times are not polynomial.There are things in between - for example, the best known algorithm for factoring runs in time O(exp(Cn1/3log2/3n)) for some constant C>0; such a running time is known as sub-exponential. Other algorithms could run in time O(exp(AlogCn)) for some A>0 and C>1, and these are known as quasi-polynomial. Such an algorithm has very recently been claimed for discrete log over small characteristics.

Explanation:

.....hope it helps you............