"Complexity of Subtype Satisfiability over Posets."

Joachim Niehren, Tim Priesnitz, Zhendong Su (2005)

Details and statistics

DOI: 10.1007/978-3-540-31987-0_25

access: open

type: Conference or Workshop Paper

metadata version: 2021-11-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.