## About

polynomial time algorithm.

## Articles Related

## Tractable/Untractable

A problem that:

- can be solved in polynomial time is Tractable
- can NOT be solved in polynomial time is intractable

## One-Way

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