P = NP if and only if there exists a Turing machine T and a natural number k such that <j>(ri) < nk,
in [
Math
]
Prev:
"Transitive closure"-like relation
Next:
Linear approximations
From:
sci.math
on
6 Jul 2010 19:53
P = NP if and only if there exists a Turing machine T and a
natural number k such that <j>(ri) < nk,
|
Pages: 1
Prev:
"Transitive closure"-like relation
Next:
Linear approximations