Approximations by OBDDs and the Variable Ordering Problem
| dc.contributor.author | Krause, Matthias | de |
| dc.contributor.author | Savicky, Petr | de |
| dc.contributor.author | Wegener, Ingo | de |
| dc.date.accessioned | 2004-12-07T08:19:58Z | |
| dc.date.available | 2004-12-07T08:19:58Z | |
| dc.date.created | 1999 | de |
| dc.date.issued | 2001-10-16 | de |
| dc.description.abstract | Ordered binary decision diagrams (OBDDs) and their variants are motivated by the need to represent Boolean functions in applications. Research concerning these applications leads also to problems and results interesting from theoretical point of view. In this paper, methods from communication complexity and information theory are combined to prove that the direct storage access function and the inner product function have the following property. They have linear pi-OBDD size for some variable ordering pi and, for most variable orderings pi0 , all functions which approximate them on considerably more than half of the inputs, need exponential pi0-OBDD size. These results have implications for the use of OBDDs in genetic programming. | en |
| dc.format.extent | 166848 bytes | |
| dc.format.extent | 244267 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5367 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15157 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 58 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Approximations by OBDDs and the Variable Ordering Problem | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |