Titlebook: Algorithms and Data Structures in VLSI Design; OBDD - Foundations a Christoph Meinel,Thorsten Theobald Textbook 1998 Springer-Verlag Berlin

結(jié)合

conference

Introductioner finite domains. The dependencies and relations among the objects are modeled by means of discrete functions. By introducing a binary encoding for the elements of the underlying domain, each finite problem can be fully expressed by means of ., i.e., functions mapping bit vectors to single bits. Co

針葉類的樹

Amenable

Classical Representationsble description types. Basically, the representation has to describe the function adequately and thoroughly, i.e., it must be completely clear from the representation which switching function is considered. Besides this fundamental condition, which has always to be satisfied, a series of further pro

有惡意

OBDDs — Ordered Binary Decision Diagramsanching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986, by adding some ingenious ordering restrictions to these models and providing a sophisticated reduction mechanism, R. Bryant substa

evaculate

種屬關(guān)系

變異

Variants and Extensions of OBDDs application fields, these refined models are better suited than the “classic” OBDDs. We would like to present some particularly interesting and important developments in this area, although the relevant research efforts have not been completed yet. The search for more compact representations of swi

安撫

9樓

殺人

10樓