"Proving NP-completeness Using BOUNDED TILING."

Bogdan S. Chlebus (1987)

Details and statistics

DOI:

access: unavailable

type: Journal Article

metadata version: 2020-03-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics