"The Complexity of Checking Redundancy of CNF Propositional Formulae."

Paolo Liberatore (2002)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2003-11-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics