| Display title | FP (complexity) |
| Default sort key | Fp (Complexity) |
| Page length (in bytes) | 2,979 |
| Namespace ID | 0 |
| Page ID | 259267 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>NBrush |
| Date of page creation | 06:12, 27 June 2023 |
| Latest editor | imported>NBrush |
| Date of latest edit | 06:12, 27 June 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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... |
