Jump to content

FP (complexity)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Gdr (talk | contribs) at 16:49, 18 May 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computational complexity theory, the complexity class FP is the set of function problems which can be solved by a deterministic Turing machine in polynomial time.

Retrieved from "https://en.wikipedia.org/w/index.php?title=FP_(complexity)&oldid=3805023"