Non User
Index: >
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Business
Non User
Industries
Finance
Tax
Home
> FNP (complexity)
In
computational complexity theory
, the
complexity class
FNP
is the set of
function problem
s which can be solved by a
non-deterministic Turing machine
in
polynomial time
.
This article is a
stub
. You can
help
Wikipedia by [ ṣlocalurl: : |action=edit}} expanding it]
.
Complexity classes
Non User
