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

Matthew P. Johnson (2018)

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2018.12

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics