Authors: Wölfel, Philipp
Title: Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen
Language (ISO): de
Subject Headings: Multiplikation
Komplexitätstheorie
Branchingprogramme
Modell
BDD
binary decision diagram
OBDD
open binary decision diagram
FBDD
free binary decision diagram
Hashing
URI: http://hdl.handle.net/2003/2539
http://dx.doi.org/10.17877/DE290R-7870
Issue Date: 2004-04-19
Publisher: Universität Dortmund
Appears in Collections:LS 02 Komplexitätstheorie und Effiziente Algorithmen

Files in This Item:
File Description SizeFormat 
Woelfelunt.pdfDNB359.64 kBAdobe PDFView/Open
abstract.pdf15.83 kBAdobe PDFView/Open
woelfel.ps635.56 kBPostscriptView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.