Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
FNP (complexity)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Related complexity classes == * [[FP (complexity)|FP]] is the set of binary relations for which there is a polynomial time algorithm that, given ''x'', finds some ''y'' for which P(''x'',''y'') holds. The relation between FNP and FP is analogous to the relation between NP and P. *[[TFNP]] is a subset of FNP: it contains those relations in FNP for which, for every ''x'', there exists at least one ''y'' for which P(''x'',''y'') holds.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)