pseudo-polynomial time

Angol

Főnév

pseudo-polynomial time (tsz. pseudo-polynomial times)

1. (informatika) 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 (the largest integer present in the input)—but not necessarily in the length of the input (the number of bits required to represent it), which is the case for polynomial time algorithms.

További információk

• pseudo-polynomial time - Szótár.net (en-hu)
• pseudo-polynomial time - Sztaki (en-hu)
• pseudo-polynomial time - Merriam–Webster
• pseudo-polynomial time - Cambridge
• pseudo-polynomial time - WordNet
• pseudo-polynomial time - Яндекс (en-ru)
• pseudo-polynomial time - Google (en-hu)
• pseudo-polynomial time - Wikidata
• pseudo-polynomial time - Wikipédia (angol)