Pseudo-polynomial time

Pseudo-polynomial time

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is bounded from above by a polynomial function of the two variables: the numeric value of the input (the largest integer present in the input) and the length of the input (the number of bits required to represent it).

Excerpt from the Wikipedia article “Pseudo-polynomial time”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Pseudo-polynomial time to your collection.

Play for free

Related cards