"Deciding the Closure of Inconsistent Rooted Triples is NP-Complete."

Matthew P. Johnson (2018)

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