๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Nonapproximability of OBDD Minimization

โœ Scribed by Detlef Sieling

Book ID
112252664
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
275 KB
Volume
172
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Limits of Nonapproximability of L
On the Limits of Nonapproximability of Lattice Problems
โœ Oded Goldreich; Shafi Goldwasser ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

We show simple constant-round interactive proof systems for problems capturing the approximability, to within a factor ofn, of optimization problems in integer lattices, specifically, the closest vector problem (CVP) and the shortest vector problem (SVP). These interactive proofs are for the coNP di

Asymptotically Optimal Bounds for OBDDs
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
โœ Beate Bollig; Ingo Wegener ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 262 KB

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 asym