bn:02502625n
Noun Concept
Categories: Computational complexity theory, Complexity classes, Pseudo-polynomial time algorithms, Analysis of algorithms
EN
pseudo-polynomial time  Pseodupolynomial time algorithm  pseudo-polynomial  Pseudo-polynomial-time  pseudopolynomial
EN
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input —but not necessarily in the length of the input, which is the case for polynomial time algorithms. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input —but not necessarily in the length of the input, which is the case for polynomial time algorithms. Wikipedia