IYAKAR SAURIN NEMAN CLIQUE TA RUSHE BAYAN SHEKARU 40
A yi tunanin wata hanyar sadarwa ta zamantakewa (social network) mai mutane n. Shin akwai wani rukuni na mutum k daga cikinsu da dukansu suka san juna? Masana kimiyyar kwamfuta suna kiran irin wannan rukuni k-clique, kuma nemo ɗaya wata matsala ce ta gargajiya mai amfani marasa adadi. Hanya mafi sauƙi (naive) tana duba kowane rukuni na mutane k da zai yiwu, kusan n^k daga cikinsu — abin da ba zai yiwu ba ga manyan hanyoyin sadarwa.
Dabarar 1985 da wani dogon ƙalubale
Fiye da shekaru 40 da suka wuce, Jaroslav Nešetřil da Svatopluk Poljak sun gano wata gajeriyar hanya. Sun mayar da neman k-clique zuwa neman alwatika (triangle) a cikin wani graph (zane-zanen haɗi) mafi girma, wanda shi kuma za a iya yi ta hanyar ninka matrices (matrix multiplication), manyan teburan lambobi. Kuɗin lissafin (cost) ya dogara da ω, ma’aunin ƙarfi (exponent) na ninka matrix: hanyarsu tana ɗaukar kusan matakai n^(ωk/3). Babu wanda ya san ω daidai. Aƙalla 2 ne, kuma takardar ta ambaci wata iyakar sama (upper bound) ta baya-bayan nan ta 9/4.
Ba a taɓa doke ma’aunin ƙarfin wannan hanya ta 1985 ba. A 2004, wani ƙalubale daga Gerhard Woeginger ya buƙaci masu bincike su yi abin da ya fi hakan ga wani k tsayayye; fiye da shekaru ashirin suka wuce. A halin da ake ciki, hasashen k-Clique (k-Clique Hypothesis) — cewa n^(ωk/3) shi ne kusan mafi kyau da zai yiwu — ya zama ginshiƙin “nazarin wahalar lissafi dalla-dalla” (fine-grained complexity). Masu bincike sun yi amfani da shi don nuna cewa wasu matsaloli da yawa, daga nazarin nahawu (parsing grammars) zuwa nazarin bayanan da aka matsa (compressed data), su ma ba za a iya warware su cikin sauri ba.
Manufa mai motsi
Ƙaryata wannan hasashe yana da wata wahala ta musamman. Kuɗin lissafin da yake hasashe ya dogara da ω, wanda ba a sani ba. Algorithm da ya doke mafi kyawun ƙimar ω ta yau zai iya daina doke hasashen idan daga baya wani ya gano ninka matrix mafi sauri.
Virginia Vassilevska Williams, daga MIT, da Or Zamir, daga Jami’ar Tel Aviv (Tel Aviv University), sun kauce wa matsalar. Sun tabbatar cewa ga kowane k mai girma isasshe, za a iya nemo k-clique — har ma a ƙirga su — a cikin kusan matakai n^((ω/3 − c)k), inda c wata tsayayyiyar lamba (constant) ce da ta fi sifili (positive), wadda ba ta dogara da k ko ω ba. Ana auna ragin ne da ainihin ƙimar ω, ko mece ce za ta kasance. Yana nan daram ko da ω = 2, mafi kyawun yanayin da za a iya tunani.
Ninke wani wedge
Zuciyar hanyar ta shafi tsare-tsare (patterns) na maki (vertices) tara. Hanyar da aka saba tana raba su zuwa rukunoni uku na uku-uku sannan ta ninka manyan matrices uku. Marubutan sun duba wani wedge — haɗi (edges) biyu da ke da maki ɗaya tare — sannan suka saka, tsakanin biyu daga cikin matrices ɗin, wani tebur da ba ya canza komai: matrix ɗin identity. Sannan suka rubuta wannan identity a matsayin jimlar wasu “musaye” (swaps) kaɗan, kowanne yana haɗa haɗi biyu na wedge ɗin su zama ɗaya, tare da wata ragowa mai ƙaramin rank (low rank).
Musayen suna ba da tsare-tsare mafi sauƙi masu ƙarancin haɗi, waɗanda ake sake sarrafa su da hanya iri ɗaya; tsari mai maki tara yana da haɗi 36 a mafi yawa, don haka maimaitawar (recursion) tana ƙarewa. Ragowar mai ƙaramin rank tana rage girman matrices da za a ninka. Amfani da dabarar a kan wedge biyu daban-daban a lokaci guda shi ne abin da ke kiyaye riba ko da ω = 2. Sannan kowane k da ke ninkin tara (multiple of nine) za a iya haɗa shi zuwa tubala tara.
Gaskiya ne, amma ƙanƙane
Marubutan ba su ba da lambobi ga ribar ba. Sun bayyana tsayayyun lambobin (constants) da cewa suna tsakanin “ƙanƙane matuƙa ba tare da ingantawa ba zuwa ƙanƙane tare da ingantawa mai yawa”. Manufar ba sauri a aikace ba ce: ita ce cewa wani shinge da aka yi imani da shi tsawon shekaru da dama babu shi.
Tasirin ya wuce clique. Algorithms na ainihi (exact algorithms) don matsalolin ingantawa (optimisation) masu wuya kamar Max-Cut da Max-2-SAT, waɗanda ke gudana a kusan matakai 2^(ωn/3) ga masu sauyi (variables) n, yanzu su ma sun sami ƙaramin ma’aunin ƙarfi (exponent). Haka ma ƙirga kwafin kowane ƙaramin graph tsayayye.
Abin da ƙirƙirarriyar basira ta yi
A wani sashe na musamman, marubutan sun bayyana yadda suka yi aiki da ChatGPT-6, wanda aka yi amfani da shi ta shafin yanar gizonsa na jama’a (public web interface). Farawa daga nasu ra’ayoyin game da clique na mutane biyar da kuma wani sakamakon OpenAI na baya-bayan nan da ya ƙaryata wani zato (conjecture) na daban, Exponential Time Hypothesis, samfurin (model) ya sami ingantawa ta farko mai sarƙaƙiya ga 5-clique. Sannan marubutan suka tace ta, da taimakon AI ɗin, zuwa rarrabuwar algebra (algebraic decomposition) da ke tsakiyar hujjar, wadda suke ɗauka a matsayin “kusan gudummawar AI zalla”. Tsarin algorithm (algorithmic framework) da aka gina a kewayenta, a cewarsu, galibi nasu ne.
Wata magana ɗaya ta yi fice. Marubutan sun lura cewa hujjoji masu wuyar ganewa da AI ke samarwa suna da wuyar karantawa ga ɗan Adam — kuma “abin ya burge su cewa su ma suna da wuyar fahimta ga ita kanta AI ɗin”.
