What graphs can be efficiently represented by BDDs? / C. Dong and P. Molitor

Kurzanzeige
cbs.date.changed2021-02-17
cbs.date.creation2006-01-30
cbs.picatypeOa
cbs.publication.displayformHalle (Saale), 2005
dc.contributor.authorDong, C.
dc.contributor.authorMolitor, Paul
dc.date.accessioned2025-06-02T12:16:56Z
dc.date.issued2005
dc.description.noteParallel als Buch-Ausg. erschienen
dc.format.extentOnline-Resource (PDF-Datei: 16 S., 0,17 MB)
dc.genrebook
dc.identifier.ppn506505545
dc.identifier.urihttps://epflicht.bibliothek.uni-halle.de/handle/123456789/15479
dc.identifier.urnurn:nbn:de:gbv:3:2-7594
dc.identifier.vl-id46856
dc.language.isoeng
dc.relation.ispartofseriesReports ; 2005,07 ppn:389849081
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc510
dc.titleWhat graphs can be efficiently represented by BDDs? / C. Dong and P. Molitor
dc.typeBook
dspace.entity.typeMonograph
local.accessrights.itemAnonymous
local.openaccesstrue

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
urn_nbn_de_gbv_3_2-7594.pdf
Größe:
174.84 KB
Format:
Adobe Portable Document Format
Beschreibung:
What graphs can be efficiently represented by BDDs?
Herunterladen

Sammlungen

E-Book