[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/Wegener94a>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ingo_Wegener>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.324559>
foaf:homepage <https://doi.org/10.1109/12.324559>
dc:identifier DBLP journals/tc/Wegener94a (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.324559 (xsd:string)
dcterms:issued 1994 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ingo_Wegener>
swrc:number 11 (xsd:string)
swrc:pages 1262-1269 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/Wegener94a/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/Wegener94a>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc43.html#Wegener94a>
rdfs:seeAlso <https://doi.org/10.1109/12.324559>
dc:subject Boolean functions; directed graphs; computational complexity; programming theory; optimal read-once branching programs; Boolean functions; ordered binary-decision diagrams; minimal read-once branching program size; reduction rules; size complexity; variable ordering. (xsd:string)
dc:title The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 43 (xsd:string)