 |
 |
|
 |
 |
|
|
|
|
|
|
Encyclopedia :
F :
FN :
FNP :
FNP (complexity) |
|
|
FNP (complexity)In computational complexity theory, the complexity class FNP is the set of function problems which can be solved by a non-deterministic Turing machine in polynomial time.
|
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |
