The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1972 vol.21)
pp: 606-610
H. R. Hwa , Basser Computing Department, University of Sydney, Sydney, New South Wales, Australia.
ABSTRACT
This note attempts to show that, in a vertex weight method [1], every contradiction equation bears a one-to-one correspondence with the summability pair C<inf>1S</inf>, C<inf>2S</inf>, where C<inf>1S</inf> = {X<inf>11</inf>, X<inf>12</inf>, ..., X<inf>1k</inf>}¿ C<inf>1</inf> C<inf>2S</inf> = {X<inf>21</inf>, X<inf>22</inf>,..., X<inf>2k</inf>} ¿ C<inf>2</inf> and vector sums of the vertices plz check [Eqa] The vertices, X<inf>ki</inf>'s, K = 1, or 2, are not necessarily distinct, and C<inf>1</inf>, C<inf>2</inf> are two disjoint sets of vertices in E<sup>n</sup> space. As a consequence, the contradiction equation is a necessary and sufficient condition that the homogeneous system, solved for a threshold function of order r, has no solution. This tells that the threshold function is of order greater than r.
CITATION
H. R. Hwa, "Contradiction Equations in a B Matrix of Vertex Weight Method and Their Correspondence with the k-Summability Property of Vertices", IEEE Transactions on Computers, vol.21, no. 6, pp. 606-610, June 1972, doi:10.1109/TC.1972.5009019
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool