"One-in-Two-Matching Problem is NP-complete"

Sergio Caracciolo, Davide Fichera, Andrea Sportiello (2006)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics