布爾序集相鄰邏輯對(duì)稱的實(shí)現(xiàn)
REALIZATION OF THE NEIGHBOURING LOGIC SYMMETRY FOR BOOLEAN ORDERED SET
-
摘要: 本文提出一種用邏輯對(duì)稱軸的關(guān)系,解決N維布爾序集唯一相鄰的邏輯路徑問(wèn)題。同時(shí)還給出一種限維內(nèi)任一邏輯相鄰子集的確定方法。其結(jié)果簡(jiǎn)單直觀,適合于計(jì)算機(jī)實(shí)現(xiàn)。這種思想,對(duì)于二分樹(shù)快速搜尋和二分樹(shù)排序決策等,也具有一定意義。
-
關(guān)鍵詞:
- 布爾序集; 唯一相鄰路徑; 邏輯對(duì)稱軸
Abstract: By means of logic symmetric relation, single neighbouring logic path for N dimension Boolean ordered set is solved. A new method of determining any logic neighbouring subset in limited dimensions is given. Its results are intuitional and realizable for computer. -
S.季普繹茨著,杜瑋編譯,離散數(shù)學(xué),宇航出版社,北京,1985,2.[2][羅] .I. Tomescu著, 清華大學(xué)應(yīng)用數(shù)學(xué)系離散數(shù)學(xué)教研室譯,組合學(xué)引論,高教出版社,北京,1985. 7.[3][美]. J. L. 凱萊著,吳從炘等譯,一般拓?fù)鋵W(xué),科學(xué)出版社,北京,1982. 5. -
計(jì)量
- 文章訪問(wèn)數(shù): 1832
- HTML全文瀏覽量: 105
- PDF下載量: 416
- 被引次數(shù): 0