login::  password::




cwbe coordinatez:
101
63532
683817
683643
683657
5122430
5122458

ABSOLUT
KYBERIA
permissions
you: r,
system: public
net: yes

neurons

stats|by_visit|by_K
source
tiamat
commanders
polls

total descendants::0
total children::0
1 K

show[ 2 | 3] flat


||0
Autor/Author: Daniel Hromada
Nazov/Title: The Solution of ???P=NP??? Problem
Jazyk/Language: EN
Medium: PDF
Velkost/size: 206 KiB
Stran/Pages: 4
Popis/Comment: In this short text, I'll sketch out two possible answers to the question ' Is P equal to NP?'. Two conjectures, out of which at least one is certainly true (if the law of excluded middle is true). When discussing the P = NP conjecture, two possible approaches will be introduced which could possibly serve to one who will decide to demonstrate that P=NP. One will be less scientific than the other, the other will reveal its effectiveness faster than the one. The first approach – a theoretical one – will point out the usefulness of so-called P-complex 'Power' method in obtaining precious information about the overall (i.e. global) state of the studied system (e.g. a city network in case of Traveling Salesman Problem). The second approach – so-called physical one – will propose so-called Physical Machine able to solve the NP problem by high-paralelity of mutual relations of its basic components. Only a brief advise of epistemologic nature will be given when discussing P NP conjecture
[Klucove slova/keywords:]
[Linky/links:]