Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Wegener, Ingo	de
dc.contributor.author	Wölfel, Philipp	de
dc.date.accessioned	2004-12-06T12:50:20Z	-
dc.date.available	2004-12-06T12:50:20Z	-
dc.date.created	2003-12-15	de
dc.date.issued	2004-04-19	de
dc.identifier.uri	http://hdl.handle.net/2003/2539	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-7870	-
dc.format.extent	368271 bytes	-
dc.format.extent	16211 bytes	-
dc.format.extent	650817 bytes	-
dc.format.mimetype	application/pdf	-
dc.format.mimetype	application/pdf	-
dc.format.mimetype	application/postscript	-
dc.language.iso	de	de
dc.publisher	Universität Dortmund	de
dc.subject	Multiplikation	de
dc.subject	Komplexitätstheorie	de
dc.subject	Branchingprogramme	de
dc.subject	Modell	de
dc.subject	BDD	en
dc.subject	binary decision diagram	en
dc.subject	OBDD	en
dc.subject	open binary decision diagram	en
dc.subject	FBDD	de
dc.subject	free binary decision diagram	en
dc.subject	Hashing	de
dc.subject.ddc	004	de
dc.title	Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen	de
dc.type	Text	de
dc.contributor.referee	Vöcking, Berthold	de
dc.date.accepted	2003	-
dc.type.publicationtype	doctoralThesis	de
dcterms.accessRights	open access	-
Appears in Collections:	LS 02 Komplexitätstheorie und Effiziente Algorithmen

Files in This Item:

File	Description	Size	Format
Woelfelunt.pdf	DNB	359.64 kB	Adobe PDF	View/Open
abstract.pdf		15.83 kB	Adobe PDF	View/Open
woelfel.ps		635.56 kB	Postscript	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org