Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02502625n
Noun Concept
AR
No term available
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
Relations
Sources
IS A
قسم تعقيد
HAS PART
EN
Weak NP-completeness

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License