Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
โ Scribed by Beate Bollig; Ingo Wegener
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 262 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
Ordered binary decision diagrams (OBDDs) are nowadays the most common dynamic data structure or representation type for Boolean functions. Among the many areas of application are verification, model checking, and computer aided design. For many functions it is easy to estimate the OBDD size but asymptotically optimal bounds are only known in simple situations. In this paper, methods for proving asymptotically optimal bounds are presented and applied to the solution of some basic problems concerning OBDDs. The largest size increase by a synthesis step of ?-OBDDs followed by an optimal reordering is determined as well as the largest ratio of the size of deterministic finite automata, quasi-reduced OBDDs, and zero-suppressed BDDs compared to the size of OBDDs. Moreover, the worst case OBDD size of functions with a given number of 1-inputs is investigated. 2000
๐ SIMILAR VOLUMES
The method of multiple scales is implemented in Maple V Release 2 to generate a uniform asymptotic solution O( r ) for a weakly nonlinear oscillator. In recent work, it has been shown that the method of multiple scales also transforms the differential equations into normal form, so the given algorit