Jump to content

FP (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Andris (talk | contribs) at 18:04, 31 May 2004 (Category:Complexity classes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

This article is a stub. You can help Wikipedia by expanding it.

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