About FP

In computational complexity theory, the complexity class FP is the set of function problems that can be solved by a deterministic Turing machine in polynomial time. It is the function problem version of the decision problem class P. Roughly speaking, it is the class of functions that can be efficiently computed on classical computers without randomization.

members

here now

Everything about FP →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

FP

complexity class

0members1here now

Ask Genius Site

Site Journal

Not who you're looking for? Others named FP: programming language · Francis Poulenc catalogue of works

Feed Discussions About

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About FP

members

here now

Everything about FP →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

Not who you're looking for? Others named FP: programming language · Francis Poulenc catalogue of works