|Author(s):||Ákos Tajti and Benedek Nagy|
|Slot:||Array, 11:00-11:20, col. 4|
New computing paradigms are usually legitimated by showing their computing power. Hard, usually NP-complete problems are shown to be solved in efficient way. One of the well known NP-complete problem is the Tripartite Matching. In this paper this problem is solved by a polynomial Interval-valued computation.
|websites: Arnold Beckmann||2008-05-19|