Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Solving Tripartite Matching by Interval-valued Computation in Polynomial Time

Edit abstract data

Author(s): Ákos Tajti and Benedek Nagy
Slot: Fri, 11:00-11:20, Room 22 (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 Valid HTML 4.01! Valid CSS!