Polynomial time algorithms

Sorting Quicksort Anim


polynomial time algorithm.


A problem that:


A function f is a one-way if and only if it can be computed by a polynomial time algorithm.

NP Complete

NP Complete problems can only possibly be solved in polynomial time

Discover More
Sorting Quicksort Anim
Algorithm - NP Complete (Nondeterministic Polynomial Time Complete)

This is a class of problems that are so difficult that even the best solutions cannot consistently determine their solutions in an efficient way. Specifically, NP Complete problems can only possibly...
Model Funny
Function - One way

With a one way function, it should be hard to determine the original input when only the output is known. They are fundamental tools for: cryptography, authentication, and other data security...
Card Puncher Data Processing
Software Design - Scalability (Scale Up|Out)

Increasing or decreasing the capacity of a system by making effective use of resources is known as scalability. A scalable system can handle increasing numbers of requests without adversely affecting response...
Sorting Quicksort Anim
Tractable / Intractable Problem

Tractable: a problem that can be solved in polynomial time intractable: a problem that can NOT be solved in polynomial time the problems that can be solved by a computer using no more time than...

Share this page:
Follow us:
Task Runner