A Symmetric, Polyvalent Matchmaking

Granularity 1.2 1.3 1.4 Ratio 1.4E-4 3.6E-6 1E-6 As is well known, solving Q1 and Q2 is a NP-hard problem [7]. Because the solution of NP-hard problems requires (in the worst case) an exhaustive search, this reduction in search space size helps to improve search algorithm performance. Search algorithm ................
................