Table of Contents

About

polynomial time algorithm.

Tractable/Untractable

A problem that:

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