User:MartinMMusatov: Difference between revisions
Jump to navigation
Jump to search
(New page: '''P = NP problem''' In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation: P = ⋯⋮⋱⋮⋯ N ⋯⋮...) |
(No difference)
|
Revision as of 00:20, 24 February 2009
P = NP problem In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation:
P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P