"Two slightly-entangled NP-complete problems."

Roman Orus (2005)

Details and statistics

DOI: 10.26421/QIC5.6-3

access: closed

type: Journal Article

metadata version: 2021-04-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics