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 |
Provenance: | Universität Dortmund |
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 |
This item is protected by original copyright rightsstatements.org