Kwamfuta da AI · gwajin
Doke iyakar
Hanyar sadarwa, rukunin mutane da dukansu suka san juna, gajeriyar hanya ta 1985 ta hanyar ninka matrices, da hasashe da ya tsaya tsawon shekaru da dama. Tambayoyi huɗu, daga mafari zuwa ƙwararre, kan ƙarshen hasashen k-Clique.
1 · Faɗi abin da aka tabbatar
Mafari
Me labarin ya nuna game da hasashen k-Clique?
2 · Lissafa kuɗin 1985
Hanyar Nešetřil–Poljak tana nemo k-clique a cikin kusan matakai n^(ωk/3). Ɗauki k = 9 da ω = 2, mafi ƙarancin ƙimar da ω zai iya samu.
Matsakaici
Wane ma'aunin ƙarfi na n ne hanyar 1985 ke bayarwa?
3 · Bayyana “ko da ω = 2”
Hasashen yana hasashen kuɗin lissafi na n^(ωk/3). Ba a san ainihin ƙimar ω ba: aƙalla 2 ne, kuma labarin ya ambaci iyakar sama ta 9/4.
Ƙwararre
Me ya sa yana da muhimmanci cewa sabon ragin yana nan ko mene ne ω, har ma ω = 2?
4 · Kai ribar zuwa wasu matsaloli
A da, ana warware Max-2-CSP, wanda ya ƙunshi Max-Cut da Max-2-SAT, a kan masu sauyi Boolean n, a cikin kusan matakai 2^(ωn/3). Raba masu sauyin zuwa rukunoni tara, kuma ƙimomin da aka ba kowane rukuni sun zama maki a cikin matsalar clique mai maki tara da nauyi a kan haɗinta.
Ƙwararre
Me sabon algorithm na clique ke bayarwa ga waɗannan matsaloli?
An doke iyakar
—