[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/mfcs/Reith03>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Steffen_Reith>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-45138-9%5F57>
foaf:homepage <https://doi.org/10.1007/978-3-540-45138-9_57>
dc:identifier DBLP conf/mfcs/Reith03 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-45138-9%5F57 (xsd:string)
dcterms:issued 2003 (xsd:gYear)
rdfs:label On the Complexity of Some Equivalence Problems for Propositional Calculi. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Steffen_Reith>
swrc:pages 632-641 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/2003>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/mfcs/Reith03/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/mfcs/Reith03>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/mfcs/mfcs2003.html#Reith03>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-45138-9_57>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/mfcs>
dc:subject Computational complexity, Boolean functions, Boolean isomorphism, Boolean equivalence, closed classes, Dichotomy, Post, satisfiability problems. (xsd:string)
dc:title On the Complexity of Some Equivalence Problems for Propositional Calculi. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document