Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

#computation #social-choice

Formally, an algorithm is* polynomial* if there exists a k ∈\(\mathbb{N}\) such that its running time is in O(n^{ k} ), where n is the size of the input. Here, O(n^{ k} ) denotes the class of all functions that, for large values of n, grow no faster than c · n^{ k} for some constant number c (this is the “Big-O notation”). For instance, when k = 1, the running time is linear, and when k = 2, the running time is quadratic in n.

If you want to change selection, open document below and click on "Move attachment"

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | suggested re-reading day | |||

started reading on | finished reading on |

Do you want to join discussion? Click here to log in or create user.