cwbe coordinatez:
101
63540
63590
5734320
8501616
8501642
8501732
8502824
8502877
8502974
8503277
8503280
8503334
8503338
8503349
8503356
8503534
8503545
8503546
8503553
8503561
8503563
8503566
8503623
8505095
8505138
8505163
8505171
8505203

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

neurons

stats|by_visit|by_K
source
tiamat
K|my_K|given_K
last
commanders
polls

total descendants::1
total children::1
show[ 2 | 3] flat


super, a teraz si precitaj definiciu np hard, a zamysli sa ci NP hard je NP hard ak P=NP




000001010006354000063590057343200850161608501642085017320850282408502877085029740850327708503280085033340850333808503349085033560850353408503545085035460850355308503561085035630850356608503623085050950850513808505163085051710850520308505383
ddd
 ddd      30.05.2018 - 18:43:25 [3K] , level: 1, UP   NEW
definicia np-hard je nezavisla od toho, ci p=np alebo nie. vela problemov je np-hard teraz a budu aj ked sa dokaze ze p=np a rovnako budu aj ked sa dokaze ze p!=np. ale vieme ze np je non-deterministic polynomial a nie non-polynomial, hej?