distr/cudd/doc/node8.html

   1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
   2
   3 <!--Converted with jLaTeX2HTML 2002-2-1 (1.70) JA patch-2.0
   4 patched version by:  Kenshi Muto, Debian Project.
   5 * modified by:  Shige TAKENO
   6 LaTeX2HTML 2002-2-1 (1.70),
   7 original version by:  Nikos Drakos, CBLU, University of Leeds
   8 * revised and updated by:  Marcus Hennecke, Ross Moore, Herb Swan
   9 * with significant contributions from:
  10   Jens Lippmann, Marek Rouchal, Martin Wilck and others -->
  11 <HTML>
  12 <HEAD>
  13 <TITLE>Index</TITLE>
  14 <META NAME="description" CONTENT="Index">
  15 <META NAME="keywords" CONTENT="cuddIntro">
  16 <META NAME="resource-type" CONTENT="document">
  17 <META NAME="distribution" CONTENT="global">
  18
  19 <META NAME="Generator" CONTENT="jLaTeX2HTML v2002-2-1 JA patch-2.0">
  20 <META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css">
  21
  22 <LINK REL="STYLESHEET" HREF="cuddIntro.css">
  23
  24 <LINK REL="previous" HREF="node7.html">
  25 <LINK REL="up" HREF="cuddIntro.html">
  26 </HEAD>
  27
  28 <BODY >
  29 <!--Navigation Panel-->
  30 <IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
  31  SRC="icons/next_g.png">
  32 <A NAME="tex2html214"
  33   HREF="cuddIntro.html">
  34 <IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
  35  SRC="icons/up.png"></A>
  36 <A NAME="tex2html210"
  37   HREF="node7.html">
  38 <IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
  39  SRC="icons/prev.png"></A>
  40 <BR>
  41 <B> Up:</B> <A NAME="tex2html215"
  42   HREF="cuddIntro.html">CUDD: CU Decision Diagram</A>
  43 <B> Previous:</B> <A NAME="tex2html211"
  44   HREF="node7.html">Bibliography</A>
  45 <BR>
  46 <BR>
  47 <!--End of Navigation Panel-->
  48 <BR>
  49
  50 <H2><A NAME="SECTION00080000000000000000">
  51 Index</A>
  52 </H2><DL COMPACT>
  53 <DT><STRONG>ADD</STRONG>
  54 <DD><A HREF="node1.html#16">Introduction</A>
  55  | <A HREF="node3.html#116">Nodes</A>
  56  | <A HREF="node3.html#261">New Constants</A>
  57  | <A HREF="node3.html#335">Basic ADD Manipulation</A>
  58 <DT><STRONG>aggregation</STRONG>
  59 <DD><A HREF="node3.html#473">Variable Reordering for BDDs</A>
  60 <DT><STRONG>Algebraic Decision Diagram</STRONG>
  61 <DD><i>see </i> ADD
  62 <DT><STRONG>arc</STRONG>
  63 <DD><DL COMPACT>
  64 <DT><STRONG>complement</STRONG>
  65 <DD><A HREF="node3.html#270">New BDD and ADD</A>
  66  | <A HREF="node3.html#673">Writing Decision Diagrams to</A>
  67  | <A HREF="node3.html#673">Writing Decision Diagrams to</A>
  68  | <A HREF="node4.html#798">Complement Arcs</A>
  69  | <A HREF="node4.html#802">Complement Arcs</A>
  70 <DT><STRONG>regular</STRONG>
  71 <DD><A HREF="node3.html#674">Writing Decision Diagrams to</A>
  72  | <A HREF="node3.html#674">Writing Decision Diagrams to</A>
  73  | <A HREF="node4.html#801">Complement Arcs</A>
  74 </DL>
  75 <DT><STRONG>background value</STRONG>
  76 <DD><A HREF="node3.html#234">Background</A>
  77 <DT><STRONG>BDD</STRONG>
  78 <DD><A HREF="node1.html#14">Introduction</A>
  79  | <A HREF="node3.html#115">Nodes</A>
  80  | <A HREF="node3.html#200">One, Logic Zero, and</A>
  81  | <A HREF="node3.html#302">Basic BDD Manipulation</A>
  82 <DT><STRONG>Binary Decision Diagram</STRONG>
  83 <DD><i>see </i> BDD
  84 <DT><STRONG>box</STRONG>
  85 <DD><DL COMPACT>
  86 <DT><STRONG>black</STRONG>
  87 <DD><A HREF="node1.html#27">Introduction</A>
  88 <DT><STRONG>clear</STRONG>
  89 <DD><A HREF="node1.html#32">Introduction</A>
  90  | <A HREF="node4.html#697">Compiling and Linking</A>
  91 </DL>
  92 <DT><STRONG>cache</STRONG>
  93 <DD><A HREF="node3.html#141">Cache</A>
  94  | <A HREF="node3.html#144">Cache</A>
  95  | <A HREF="node3.html#146">Cache</A>
  96  | <A HREF="node3.html#163">Initializing and Shutting Down</A>
  97  | <A HREF="node4.html#800">Complement Arcs</A>
  98  | <A HREF="node4.html#810">The Cache</A>
  99 <DL COMPACT>
 100 <DT><STRONG>collision</STRONG>
 101 <DD><A HREF="node4.html#955">Non Modifiable Parameters</A>
 102 <DT><STRONG>collision list</STRONG>
 103 <DD><A HREF="node4.html#870">The Unique Table</A>
 104 <DT><STRONG>deletion</STRONG>
 105 <DD><A HREF="node4.html#956">Non Modifiable Parameters</A>
 106 <DT><STRONG>local</STRONG>
 107 <DD><A HREF="node4.html#820">The Cache</A>
 108  | <A HREF="node4.html#850">Local Caches</A>
 109 <DT><STRONG>lossless</STRONG>
 110 <DD><A HREF="node4.html#852">Local Caches</A>
 111 <DT><STRONG>reward-based resizing</STRONG>
 112 <DD><A HREF="node4.html#844">Cache Sizing</A>
 113  | <A HREF="node4.html#847">Cache Sizing</A>
 114 <DT><STRONG>sizing</STRONG>
 115 <DD><A HREF="node4.html#839">Cache Sizing</A>
 116 </DL>
 117 <DT><STRONG>cacheSize</STRONG>
 118 <DD><A HREF="node3.html#162">Initializing and Shutting Down</A>
 119 <DT><STRONG>canonical</STRONG>
 120 <DD><A HREF="node3.html#132">The Manager</A>
 121  | <A HREF="node4.html#853">Local Caches</A>
 122 <DT><STRONG>compiling</STRONG>
 123 <DD><A HREF="node3.html#79">Compiling and Linking</A>
 124  | <A HREF="node3.html#218">Predefined Constants</A>
 125  | <A HREF="node4.html#695">Compiling and Linking</A>
 126 <DT><STRONG>configuration</STRONG>
 127 <DD><A HREF="node2.html#55">The CUDD Package</A>
 128 <DT><STRONG>conversion</STRONG>
 129 <DD><DL COMPACT>
 130 <DT><STRONG>of ADDs to BDDs</STRONG>
 131 <DD><A HREF="node3.html#377">Converting ADDs to BDDs</A>
 132 <DT><STRONG>of BDDs to ADDs</STRONG>
 133 <DD><A HREF="node3.html#378">Converting ADDs to BDDs</A>
 134 <DT><STRONG>of BDDs to ZDDs</STRONG>
 135 <DD><A HREF="node3.html#357">Basic ZDD Manipulation</A>
 136  | <A HREF="node3.html#394">Converting BDDs to ZDDs</A>
 137 <DT><STRONG>of ZDDs to BDDs</STRONG>
 138 <DD><A HREF="node3.html#393">Converting BDDs to ZDDs</A>
 139 </DL>
 140 <DT><STRONG>cube sets</STRONG>
 141 <DD><A HREF="node1.html#23">Introduction</A>
 142 <DT><STRONG>cudd.h</STRONG>
 143 <DD><A HREF="node3.html#82">Compiling and Linking</A>
 144  | <A HREF="node3.html#437">Variable Reordering for BDDs</A>
 145  | <A HREF="node4.html#790">Saturating Increments and Decrements</A>
 146 <DT><STRONG><I>Cudd_addApply</I></STRONG>
 147 <DD><A HREF="node3.html#1183">Basic ADD Manipulation</A>
 148  | <A HREF="node3.html#1185">Basic ADD Manipulation</A>
 149 <DT><STRONG><I>Cudd_addBddInterval</I></STRONG>
 150 <DD><A HREF="node3.html#1201">Converting ADDs to BDDs</A>
 151 <DT><STRONG><I>Cudd_addBddPattern</I></STRONG>
 152 <DD><A HREF="node3.html#1199">Converting ADDs to BDDs</A>
 153 <DT><STRONG><I>Cudd_addBddThreshold</I></STRONG>
 154 <DD><A HREF="node3.html#1203">Converting ADDs to BDDs</A>
 155 <DT><STRONG><I>Cudd_addConst</I></STRONG>
 156 <DD><A HREF="node3.html#1153">New Constants</A>
 157 <DT><STRONG><I>Cudd_addHarwell</I></STRONG>
 158 <DD><A HREF="node3.html#1145">Background</A>
 159 <DT><STRONG><I>Cudd_AddHook</I></STRONG>
 160 <DD><A HREF="node3.html#1269">Hooks</A>
 161 <DT><STRONG><I>Cudd_addIthBit</I></STRONG>
 162 <DD><A HREF="node3.html#1207">Converting ADDs to BDDs</A>
 163 <DT><STRONG><I>Cudd_addIthVar</I></STRONG>
 164 <DD><A HREF="node3.html#1165">New BDD and ADD</A>
 165 <DT><STRONG><I>Cudd_addNewVar</I></STRONG>
 166 <DD><A HREF="node3.html#1167">New BDD and ADD</A>
 167 <DT><STRONG><I>Cudd_addNewVarAtLevel</I></STRONG>
 168 <DD><A HREF="node3.html#1169">New BDD and ADD</A>
 169  | <A HREF="node3.html#1251">Grouping Variables</A>
 170 <DT><STRONG><I>Cudd_addRead</I></STRONG>
 171 <DD><A HREF="node3.html#1143">Background</A>
 172 <DT><STRONG><I>Cudd_addTimes</I></STRONG>
 173 <DD><A HREF="node3.html#1187">Basic ADD Manipulation</A>
 174 <DT><STRONG><I>Cudd_AutodynDisable</I></STRONG>
 175 <DD><A HREF="node3.html#1221">Variable Reordering for BDDs</A>
 176 <DT><STRONG><I>Cudd_AutodynDisableZdd</I></STRONG>
 177 <DD><A HREF="node3.html#1259">Variable Reordering for ZDDs</A>
 178 <DT><STRONG><I>Cudd_AutodynEnable</I></STRONG>
 179 <DD><A HREF="node3.html#1219">Variable Reordering for BDDs</A>
 180  | <A HREF="node3.html#1225">Variable Reordering for BDDs</A>
 181 <DT><STRONG><I>Cudd_AutodynEnableZdd</I></STRONG>
 182 <DD><A HREF="node3.html#1257">Variable Reordering for ZDDs</A>
 183 <DT><STRONG><I>Cudd_bddAnd</I></STRONG>
 184 <DD><A HREF="node3.html#1175">Basic BDD Manipulation</A>
 185  | <A HREF="node3.html#1179">Basic BDD Manipulation</A>
 186  | <A HREF="node3.html#1189">Basic ADD Manipulation</A>
 187 <DT><STRONG><I>Cudd_bddConstrain</I></STRONG>
 188 <DD><A HREF="node3.html#1105">Nodes</A>
 189 <DT><STRONG><I>Cudd_bddIte</I></STRONG>
 190 <DD><A HREF="node3.html#1173">Basic BDD Manipulation</A>
 191 <DT><STRONG><I>Cudd_bddIthVar</I></STRONG>
 192 <DD><A HREF="node3.html#1155">New BDD and ADD</A>
 193 <DT><STRONG><I>Cudd_bddNewVar</I></STRONG>
 194 <DD><A HREF="node3.html#1157">New BDD and ADD</A>
 195  | <A HREF="node3.html#1161">New BDD and ADD</A>
 196  | <A HREF="node3.html#1163">New BDD and ADD</A>
 197 <DT><STRONG><I>Cudd_bddNewVarAtLevel</I></STRONG>
 198 <DD><A HREF="node3.html#1159">New BDD and ADD</A>
 199  | <A HREF="node3.html#1249">Grouping Variables</A>
 200 <DT><STRONG><I>Cudd_BddToAdd</I></STRONG>
 201 <DD><A HREF="node3.html#1205">Converting ADDs to BDDs</A>
 202 <DT><STRONG><I>Cudd_bddXor</I></STRONG>
 203 <DD><A HREF="node3.html#1191">Basic ADD Manipulation</A>
 204 <DT><STRONG>CUDD_CACHE_SLOTS</STRONG>
 205 <DD><A HREF="node3.html#164">Initializing and Shutting Down</A>
 206 <DT><STRONG><I>Cudd_CheckKeys</I></STRONG>
 207 <DD><A HREF="node4.html#1373">Debugging</A>
 208 <DT><STRONG><I>Cudd_CheckZeroRef</I></STRONG>
 209 <DD><A HREF="node4.html#1379">Debugging</A>
 210 <DT><STRONG><I>Cudd_CountMinterm</I></STRONG>
 211 <DD><A HREF="node3.html#1151">Background</A>
 212 <DT><STRONG><I>Cudd_DebugCheck</I></STRONG>
 213 <DD><A HREF="node4.html#1371">Debugging</A>
 214 <DT><STRONG><I>Cudd_DelayedDerefBdd</I></STRONG>
 215 <DD><A HREF="node4.html#1383">Non Modifiable Parameters</A>
 216 <DT><STRONG><I>Cudd_Deref</I></STRONG>
 217 <DD><A HREF="node4.html#1319"><I>Cudd_RecursiveDeref</I> vs. <I>Cudd_Deref</I></A>
 218  | <A HREF="node4.html#1331">Saturating Increments and Decrements</A>
 219 <DT><STRONG><I>Cudd_DumpBlif</I></STRONG>
 220 <DD><A HREF="node3.html#1275">Writing Decision Diagrams to</A>
 221 <DT><STRONG><I>Cudd_DumpDaVinci</I></STRONG>
 222 <DD><A HREF="node3.html#1281">Writing Decision Diagrams to</A>
 223 <DT><STRONG><I>Cudd_DumpDot</I></STRONG>
 224 <DD><A HREF="node3.html#1277">Writing Decision Diagrams to</A>
 225 <DT><STRONG><I>Cudd_ForeachCube</I></STRONG>
 226 <DD><A HREF="node3.html#1101">Nodes</A>
 227  | <A HREF="node3.html#1149">Background</A>
 228 <DT><STRONG><I>Cudd_ForeachNode</I></STRONG>
 229 <DD><A HREF="node3.html#1103">Nodes</A>
 230 <DT><STRONG><I>Cudd_HookType</I></STRONG>
 231 <DD><A HREF="node3.html#1267">Hooks</A>
 232 <DT><STRONG><I>Cudd_Init</I></STRONG>
 233 <DD><A HREF="node3.html#1113">Initializing and Shutting Down</A>
 234  | <A HREF="node3.html#1115">Initializing and Shutting Down</A>
 235 <DT><STRONG><I>Cudd_MakeTreeNode</I></STRONG>
 236 <DD><A HREF="node3.html#1241">Grouping Variables</A>
 237  | <A HREF="node3.html#1247">Grouping Variables</A>
 238 <DT><STRONG><I>Cudd_MakeZddTreeNode</I></STRONG>
 239 <DD><A HREF="node3.html#1261">Variable Reordering for ZDDs</A>
 240 <DT><STRONG><I>Cudd_Not</I></STRONG>
 241 <DD><A HREF="node3.html#1127">One, Logic Zero, and</A>
 242 <DT><STRONG><I>Cudd_PrintInfo</I></STRONG>
 243 <DD><A HREF="node4.html#1381">Gathering and Interpreting Statistics</A>
 244 <DT><STRONG><I>Cudd_PrintMinterm</I></STRONG>
 245 <DD><A HREF="node3.html#1147">Background</A>
 246 <DT><STRONG><I>Cudd_Quit</I></STRONG>
 247 <DD><A HREF="node3.html#1117">Initializing and Shutting Down</A>
 248 <DT><STRONG><I>Cudd_ReadBackground</I></STRONG>
 249 <DD><A HREF="node3.html#1141">Background</A>
 250 <DT><STRONG><I>Cudd_ReadEpsilon</I></STRONG>
 251 <DD><A HREF="node3.html#1137">Predefined Constants</A>
 252 <DT><STRONG><I>Cudd_ReadErrorCode</I></STRONG>
 253 <DD><A HREF="node4.html#1315">NULL Return Values</A>
 254 <DT><STRONG><I>Cudd_ReadInvPerm</I></STRONG>
 255 <DD><A HREF="node3.html#1181">Basic BDD Manipulation</A>
 256 <DT><STRONG><I>Cudd_ReadLogicZero</I></STRONG>
 257 <DD><A HREF="node3.html#1129">One, Logic Zero, and</A>
 258 <DT><STRONG><I>Cudd_ReadLooseUpto</I></STRONG>
 259 <DD><A HREF="node3.html#1119">Setting Parameters</A>
 260 <DT><STRONG><I>Cudd_ReadMaxGrowth</I></STRONG>
 261 <DD><A HREF="node3.html#1233">Variable Reordering for BDDs</A>
 262 <DT><STRONG><I>Cudd_ReadMinusInfinity</I></STRONG>
 263 <DD><A HREF="node3.html#1135">Predefined Constants</A>
 264 <DT><STRONG><I>Cudd_ReadOne</I></STRONG>
 265 <DD><A HREF="node3.html#1123">One, Logic Zero, and</A>
 266 <DT><STRONG><I>Cudd_ReadPlusInfinity</I></STRONG>
 267 <DD><A HREF="node3.html#1133">Predefined Constants</A>
 268 <DT><STRONG><I>Cudd_ReadReorderings</I></STRONG>
 269 <DD><A HREF="node4.html#1367">Allowing Asynchronous Reordering</A>
 270 <DT><STRONG><I>Cudd_ReadSiftMaxVar</I></STRONG>
 271 <DD><A HREF="node3.html#1229">Variable Reordering for BDDs</A>
 272 <DT><STRONG><I>Cudd_ReadTree</I></STRONG>
 273 <DD><A HREF="node3.html#1245">Grouping Variables</A>
 274 <DT><STRONG><I>Cudd_ReadZddOne</I></STRONG>
 275 <DD><A HREF="node3.html#1125">One, Logic Zero, and</A>
 276  | <A HREF="node3.html#1193">Basic ZDD Manipulation</A>
 277 <DT><STRONG><I>Cudd_ReadZero</I></STRONG>
 278 <DD><A HREF="node3.html#1131">Predefined Constants</A>
 279 <DT><STRONG><I>Cudd_RecursiveDeref</I></STRONG>
 280 <DD><A HREF="node3.html#1109">Nodes</A>
 281  | <A HREF="node4.html#1297">Reference Counts</A>
 282  | <A HREF="node4.html#1301">Reference Counts</A>
 283  | <A HREF="node4.html#1311">Reference Counts</A>
 284  | <A HREF="node4.html#1317"><I>Cudd_RecursiveDeref</I> vs. <I>Cudd_Deref</I></A>
 285  | <A HREF="node4.html#1323">When Increasing the Reference</A>
 286  | <A HREF="node4.html#1327">Saturating Increments and Decrements</A>
 287  | <A HREF="node4.html#1355">Local Caches</A>
 288  | <A HREF="node4.html#1377">Debugging</A>
 289 <DT><STRONG><I>Cudd_RecursiveDerefZdd</I></STRONG>
 290 <DD><A HREF="node3.html#1111">Nodes</A>
 291  | <A HREF="node4.html#1299">Reference Counts</A>
 292  | <A HREF="node4.html#1303">Reference Counts</A>
 293  | <A HREF="node4.html#1313">Reference Counts</A>
 294  | <A HREF="node4.html#1325">When Increasing the Reference</A>
 295  | <A HREF="node4.html#1329">Saturating Increments and Decrements</A>
 296 <DT><STRONG><I>Cudd_ReduceHeap</I></STRONG>
 297 <DD><A HREF="node3.html#1217">Variable Reordering for BDDs</A>
 298  | <A HREF="node3.html#1223">Variable Reordering for BDDs</A>
 299  | <A HREF="node3.html#1227">Variable Reordering for BDDs</A>
 300 <DT><STRONG><I>Cudd_Ref</I></STRONG>
 301 <DD><A HREF="node3.html#1107">Nodes</A>
 302  | <A HREF="node3.html#1177">Basic BDD Manipulation</A>
 303  | <A HREF="node4.html#1295">Reference Counts</A>
 304  | <A HREF="node4.html#1321">When Increasing the Reference</A>
 305 <DT><STRONG><I>Cudd_Regular</I></STRONG>
 306 <DD><A HREF="node4.html#1337">Complement Arcs</A>
 307 <DT><STRONG>CUDD_REORDER_ANNEALING</STRONG>
 308 <DD><A HREF="node3.html#485">Variable Reordering for BDDs</A>
 309 <DT><STRONG>CUDD_REORDER_EXACT</STRONG>
 310 <DD><A HREF="node3.html#491">Variable Reordering for BDDs</A>
 311 <DT><STRONG>CUDD_REORDER_GENETIC</STRONG>
 312 <DD><A HREF="node3.html#488">Variable Reordering for BDDs</A>
 313 <DT><STRONG>CUDD_REORDER_GROUP_SIFT</STRONG>
 314 <DD><A HREF="node3.html#470">Variable Reordering for BDDs</A>
 315 <DT><STRONG>CUDD_REORDER_GROUP_SIFT_CONV</STRONG>
 316 <DD><A HREF="node3.html#474">Variable Reordering for BDDs</A>
 317 <DT><STRONG>CUDD_REORDER_NONE</STRONG>
 318 <DD><A HREF="node3.html#440">Variable Reordering for BDDs</A>
 319  | <A HREF="node3.html#544">Variable Reordering for ZDDs</A>
 320 <DT><STRONG>CUDD_REORDER_RANDOM</STRONG>
 321 <DD><A HREF="node3.html#446">Variable Reordering for BDDs</A>
 322  | <A HREF="node3.html#546">Variable Reordering for ZDDs</A>
 323 <DT><STRONG>CUDD_REORDER_RANDOM_PIVOT</STRONG>
 324 <DD><A HREF="node3.html#448">Variable Reordering for BDDs</A>
 325  | <A HREF="node3.html#547">Variable Reordering for ZDDs</A>
 326 <DT><STRONG>CUDD_REORDER_SAME</STRONG>
 327 <DD><A HREF="node3.html#441">Variable Reordering for BDDs</A>
 328  | <A HREF="node3.html#545">Variable Reordering for ZDDs</A>
 329 <DT><STRONG>CUDD_REORDER_SIFT</STRONG>
 330 <DD><A HREF="node3.html#449">Variable Reordering for BDDs</A>
 331  | <A HREF="node3.html#548">Variable Reordering for ZDDs</A>
 332 <DT><STRONG>CUDD_REORDER_SIFT_CONVERGE</STRONG>
 333 <DD><A HREF="node3.html#460">Variable Reordering for BDDs</A>
 334  | <A HREF="node3.html#549">Variable Reordering for ZDDs</A>
 335 <DT><STRONG>CUDD_REORDER_SYMM_SIFT</STRONG>
 336 <DD><A HREF="node3.html#462">Variable Reordering for BDDs</A>
 337  | <A HREF="node3.html#550">Variable Reordering for ZDDs</A>
 338 <DT><STRONG>CUDD_REORDER_SYMM_SIFT_CONV</STRONG>
 339 <DD><A HREF="node3.html#468">Variable Reordering for BDDs</A>
 340  | <A HREF="node3.html#551">Variable Reordering for ZDDs</A>
 341 <DT><STRONG>CUDD_REORDER_WINDOW2</STRONG>
 342 <DD><A HREF="node3.html#475">Variable Reordering for BDDs</A>
 343 <DT><STRONG>CUDD_REORDER_WINDOW2_CONV</STRONG>
 344 <DD><A HREF="node3.html#481">Variable Reordering for BDDs</A>
 345 <DT><STRONG>CUDD_REORDER_WINDOW3</STRONG>
 346 <DD><A HREF="node3.html#479">Variable Reordering for BDDs</A>
 347 <DT><STRONG>CUDD_REORDER_WINDOW3_CONV</STRONG>
 348 <DD><A HREF="node3.html#483">Variable Reordering for BDDs</A>
 349 <DT><STRONG>CUDD_REORDER_WINDOW4</STRONG>
 350 <DD><A HREF="node3.html#480">Variable Reordering for BDDs</A>
 351 <DT><STRONG>CUDD_REORDER_WINDOW4_CONV</STRONG>
 352 <DD><A HREF="node3.html#484">Variable Reordering for BDDs</A>
 353 <DT><STRONG><I>Cudd_SetEpsilon</I></STRONG>
 354 <DD><A HREF="node3.html#1139">Predefined Constants</A>
 355 <DT><STRONG><I>Cudd_SetLooseUpTo</I></STRONG>
 356 <DD><A HREF="node3.html#1121">Setting Parameters</A>
 357 <DT><STRONG><I>Cudd_SetMaxCacheHard</I></STRONG>
 358 <DD><A HREF="node4.html#1385">Modifiable Parameters</A>
 359 <DT><STRONG><I>Cudd_SetMaxGrowth</I></STRONG>
 360 <DD><A HREF="node3.html#1235">Variable Reordering for BDDs</A>
 361 <DT><STRONG><I>Cudd_SetSiftMaxVar</I></STRONG>
 362 <DD><A HREF="node3.html#1231">Variable Reordering for BDDs</A>
 363 <DT><STRONG><I>Cudd_SetTree</I></STRONG>
 364 <DD><A HREF="node3.html#1243">Grouping Variables</A>
 365 <DT><STRONG><I>Cudd_ShuffleHeap</I></STRONG>
 366 <DD><A HREF="node3.html#1239">Variable Reordering for BDDs</A>
 367 <DT><STRONG><I>Cudd_StdPostReordHook</I></STRONG>
 368 <DD><A HREF="node3.html#1273">Hooks</A>
 369 <DT><STRONG><I>Cudd_StdPreReordHook</I></STRONG>
 370 <DD><A HREF="node3.html#1271">Hooks</A>
 371 <DT><STRONG><I>Cudd_SymmProfile</I></STRONG>
 372 <DD><A HREF="node3.html#1237">Variable Reordering for BDDs</A>
 373 <DT><STRONG>CUDD_UNIQUE_SLOTS</STRONG>
 374 <DD><A HREF="node3.html#161">Initializing and Shutting Down</A>
 375 <DT><STRONG><I>Cudd_zddDumpDot</I></STRONG>
 376 <DD><A HREF="node3.html#1279">Writing Decision Diagrams to</A>
 377 <DT><STRONG><I>Cudd_zddIsop</I></STRONG>
 378 <DD><A HREF="node3.html#1195">Basic ZDD Manipulation</A>
 379 <DT><STRONG><I>Cudd_zddIthVar</I></STRONG>
 380 <DD><A HREF="node3.html#1171">New ZDD Variables</A>
 381 <DT><STRONG><I>Cudd_zddPortFromBdd</I></STRONG>
 382 <DD><A HREF="node3.html#1211">Converting BDDs to ZDDs</A>
 383 <DT><STRONG><I>Cudd_zddPortToBdd</I></STRONG>
 384 <DD><A HREF="node3.html#1213">Converting BDDs to ZDDs</A>
 385 <DT><STRONG><I>Cudd_zddRealignDisable</I></STRONG>
 386 <DD><A HREF="node3.html#1265">Keeping Consistent Variable Orders</A>
 387 <DT><STRONG><I>Cudd_zddRealignEnable</I></STRONG>
 388 <DD><A HREF="node3.html#1263">Keeping Consistent Variable Orders</A>
 389 <DT><STRONG><I>Cudd_zddReduceHeap</I></STRONG>
 390 <DD><A HREF="node3.html#1253">Variable Reordering for ZDDs</A>
 391 <DT><STRONG><I>Cudd_zddShuffleHeap</I></STRONG>
 392 <DD><A HREF="node3.html#1255">Variable Reordering for ZDDs</A>
 393 <DT><STRONG><I>Cudd_zddVarsFromBddVars</I></STRONG>
 394 <DD><A HREF="node3.html#1209">Converting BDDs to ZDDs</A>
 395  | <A HREF="node3.html#1215">Converting BDDs to ZDDs</A>
 396 <DT><STRONG><I>Cudd_zddWeakDiv</I></STRONG>
 397 <DD><A HREF="node3.html#1197">Basic ZDD Manipulation</A>
 398 <DT><STRONG><I>cuddCacheInsert</I></STRONG>
 399 <DD><A HREF="node4.html#1343">The Cache</A>
 400 <DT><STRONG><I>cuddCacheInsert1</I></STRONG>
 401 <DD><A HREF="node4.html#1351">The Cache</A>
 402 <DT><STRONG><I>cuddCacheInsert2</I></STRONG>
 403 <DD><A HREF="node4.html#1347">The Cache</A>
 404 <DT><STRONG><I>cuddCacheLookup</I></STRONG>
 405 <DD><A HREF="node4.html#1345">The Cache</A>
 406 <DT><STRONG><I>cuddCacheLookup1</I></STRONG>
 407 <DD><A HREF="node4.html#1353">The Cache</A>
 408 <DT><STRONG><I>cuddCacheLookup2</I></STRONG>
 409 <DD><A HREF="node4.html#1349">The Cache</A>
 410 <DT><STRONG>CUDDDIR</STRONG>
 411 <DD><A HREF="node3.html#588">Using the CUDD Package</A>
 412 <DT><STRONG><I>cuddHeapProfile</I></STRONG>
 413 <DD><A HREF="node4.html#1375">Debugging</A>
 414 <DT><STRONG><I>cuddI</I></STRONG>
 415 <DD><A HREF="node4.html#1357">The Unique Table</A>
 416 <DT><STRONG>cuddInt.h</STRONG>
 417 <DD><A HREF="node4.html#920">Debugging</A>
 418 <DT><STRONG><I>cuddIZ</I></STRONG>
 419 <DD><A HREF="node4.html#1359">The Unique Table</A>
 420 <DT><STRONG><I>cuddSatDec</I></STRONG>
 421 <DD><A HREF="node4.html#1335">Saturating Increments and Decrements</A>
 422 <DT><STRONG><I>cuddSatInc</I></STRONG>
 423 <DD><A HREF="node4.html#1333">Saturating Increments and Decrements</A>
 424 <DT><STRONG><I>cuddUniqueConst</I></STRONG>
 425 <DD><A HREF="node4.html#1287">Reference Counts</A>
 426  | <A HREF="node4.html#1293">Reference Counts</A>
 427  | <A HREF="node4.html#1309">Reference Counts</A>
 428 <DT><STRONG><I>cuddUniqueInter</I></STRONG>
 429 <DD><A HREF="node4.html#1283">Reference Counts</A>
 430  | <A HREF="node4.html#1289">Reference Counts</A>
 431  | <A HREF="node4.html#1305">Reference Counts</A>
 432  | <A HREF="node4.html#1339">Complement Arcs</A>
 433  | <A HREF="node4.html#1341">Complement Arcs</A>
 434  | <A HREF="node4.html#1361">Allowing Asynchronous Reordering</A>
 435  | <A HREF="node4.html#1365">Allowing Asynchronous Reordering</A>
 436  | <A HREF="node4.html#1369">Allowing Asynchronous Reordering</A>
 437 <DT><STRONG><I>cuddUniqueInterZdd</I></STRONG>
 438 <DD><A HREF="node4.html#1285">Reference Counts</A>
 439  | <A HREF="node4.html#1291">Reference Counts</A>
 440  | <A HREF="node4.html#1307">Reference Counts</A>
 441  | <A HREF="node4.html#1363">Allowing Asynchronous Reordering</A>
 442 <DT><STRONG>DD_CACHE_PROFILE</STRONG>
 443 <DD><A HREF="node4.html#1012">Extended Statistics and Reporting</A>
 444 <DT><STRONG>DD_DEBUG</STRONG>
 445 <DD><A HREF="node4.html#911">Debugging</A>
 446 <DT><STRONG>DD_STATS</STRONG>
 447 <DD><A HREF="node4.html#1011">Extended Statistics and Reporting</A>
 448 <DT><STRONG>DD_UNIQUE_PROFILE</STRONG>
 449 <DD><A HREF="node4.html#1013">Extended Statistics and Reporting</A>
 450 <DT><STRONG>DD_VERBOSE</STRONG>
 451 <DD><A HREF="node4.html#1014">Extended Statistics and Reporting</A>
 452 <DT><STRONG>DdManager</STRONG>
 453 <DD><A HREF="node3.html#134">The Manager</A>
 454  | <A HREF="node3.html#149">Initializing and Shutting Down</A>
 455 <DT><STRONG>DdNode</STRONG>
 456 <DD><A HREF="node3.html#92">Nodes</A>
 457  | <A HREF="node4.html#818">The Cache</A>
 458 <DT><STRONG>debugging</STRONG>
 459 <DD><A HREF="node4.html#909">Debugging</A>
 460 <DT><STRONG>DEC Alpha</STRONG>
 461 <DD><A HREF="node3.html#217">Predefined Constants</A>
 462  | <A HREF="node3.html#655">Using the CUDD Package</A>
 463 <DT><STRONG>documentation</STRONG>
 464 <DD><A HREF="node4.html#1018">Guidelines for Documentation</A>
 465 <DL COMPACT>
 466 <DT><STRONG><I>Description</I></STRONG>
 467 <DD><A HREF="node4.html#1090">Guidelines for Documentation</A>
 468 <DT><STRONG>HTML files</STRONG>
 469 <DD><A HREF="node4.html#1034">Guidelines for Documentation</A>
 470 <DT><STRONG><I>SeeAlso</I></STRONG>
 471 <DD><A HREF="node4.html#1089">Guidelines for Documentation</A>
 472 <DT><STRONG><I>Synopsis</I></STRONG>
 473 <DD><A HREF="node4.html#1091">Guidelines for Documentation</A>
 474 </DL>
 475 <DT><STRONG>dot</STRONG>
 476 <DD><i>see </i> graph, drawing
 477 <DT><STRONG>Epsilon</STRONG>
 478 <DD><A HREF="node3.html#226">Predefined Constants</A>
 479 <DT><STRONG>extdoc</STRONG>
 480 <DD><i>see </i> documentation
 481 <DT><STRONG>floating point</STRONG>
 482 <DD><A HREF="node3.html#215">Predefined Constants</A>
 483 <DL COMPACT>
 484 <DT><STRONG>double (C type)</STRONG>
 485 <DD><A HREF="node3.html#126">Nodes</A>
 486 <DT><STRONG>IEEE Standard 754</STRONG>
 487 <DD><A HREF="node3.html#214">Predefined Constants</A>
 488 </DL>
 489 <DT><STRONG>free list</STRONG>
 490 <DD><A HREF="node4.html#736">Reference Counts</A>
 491 <DT><STRONG>FTP</STRONG>
 492 <DD><A HREF="node2.html#46">The CUDD Package</A>
 493  | <A HREF="node2.html#68">CUDD Friends</A>
 494  | <A HREF="node3.html#650">Using the CUDD Package</A>
 495  | <A HREF="node4.html#1019">Guidelines for Documentation</A>
 496 <DT><STRONG>function</STRONG>
 497 <DD><DL COMPACT>
 498 <DT><STRONG>characteristic</STRONG>
 499 <DD><A HREF="node1.html#22">Introduction</A>
 500  | <A HREF="node3.html#413">Converting BDDs to ZDDs</A>
 501 <DT><STRONG>cover</STRONG>
 502 <DD><A HREF="node3.html#367">Basic ZDD Manipulation</A>
 503  | <A HREF="node3.html#406">Converting BDDs to ZDDs</A>
 504  | <A HREF="node3.html#412">Converting BDDs to ZDDs</A>
 505 <DD><DL COMPACT>
 506 <DT><STRONG>irredundant</STRONG>
 507 <DD><A HREF="node3.html#370">Basic ZDD Manipulation</A>
 508 </DL>
 509 <DT><STRONG>minterms</STRONG>
 510 <DD><A HREF="node3.html#253">Background</A>
 511  | <A HREF="node4.html#887">Allowing Asynchronous Reordering</A>
 512 <DT><STRONG>ON-set</STRONG>
 513 <DD><A HREF="node1.html#24">Introduction</A>
 514 <DT><STRONG>sum of products</STRONG>
 515 <DD><A HREF="node3.html#248">Background</A>
 516 <DT><STRONG>switching</STRONG>
 517 <DD><A HREF="node1.html#20">Introduction</A>
 518  | <A HREF="node1.html#21">Introduction</A>
 519 </DL>
 520 <DT><STRONG>garbage collection</STRONG>
 521 <DD><A HREF="node3.html#113">Nodes</A>
 522  | <A HREF="node3.html#145">Cache</A>
 523  | <A HREF="node3.html#180">Setting Parameters</A>
 524  | <A HREF="node4.html#704">Reference Counts</A>
 525  | <A HREF="node4.html#735">Reference Counts</A>
 526  | <A HREF="node4.html#815">The Cache</A>
 527  | <A HREF="node4.html#854">Local Caches</A>
 528  | <A HREF="node4.html#872">The Unique Table</A>
 529 <DL COMPACT>
 530 <DT><STRONG>hooks</STRONG>
 531 <DD><A HREF="node3.html#568">Hooks</A>
 532 </DL>
 533 <DT><STRONG>gcc</STRONG>
 534 <DD><A HREF="node3.html#219">Predefined Constants</A>
 535 <DT><STRONG>generator</STRONG>
 536 <DD><A HREF="node3.html#104">Nodes</A>
 537 <DT><STRONG>global variables</STRONG>
 538 <DD><A HREF="node3.html#138">The Manager</A>
 539 <DT><STRONG>graph</STRONG>
 540 <DD><DL COMPACT>
 541 <DT><STRONG>arc capacity</STRONG>
 542 <DD><A HREF="node3.html#239">Background</A>
 543 <DT><STRONG>arc length</STRONG>
 544 <DD><A HREF="node3.html#237">Background</A>
 545 <DT><STRONG>drawing</STRONG>
 546 <DD><A HREF="node3.html#666">Writing Decision Diagrams to</A>
 547  | <A HREF="node3.html#682">Writing Decision Diagrams to</A>
 548 </DL>
 549 <DT><STRONG>growth</STRONG>
 550 <DD><A HREF="node3.html#181">Setting Parameters</A>
 551 <DT><STRONG>gzip</STRONG>
 552 <DD><A HREF="node2.html#50">The CUDD Package</A>
 553 <DT><STRONG>HAVE_IEEE_754</STRONG>
 554 <DD><A HREF="node3.html#220">Predefined Constants</A>
 555 <DT><STRONG>header files</STRONG>
 556 <DD><A HREF="node3.html#438">Variable Reordering for BDDs</A>
 557  | <A HREF="node4.html#788">Saturating Increments and Decrements</A>
 558 <DT><STRONG>hook</STRONG>
 559 <DD><A HREF="node3.html#562">Hooks</A>
 560 <DT><STRONG>infinities</STRONG>
 561 <DD><A HREF="node3.html#216">Predefined Constants</A>
 562 <DT><STRONG>installation</STRONG>
 563 <DD><A HREF="node2.html#56">The CUDD Package</A>
 564 <DT><STRONG>Intel Pentium 4</STRONG>
 565 <DD><A HREF="node2.html#61">The CUDD Package</A>
 566 <DT><STRONG>interface</STRONG>
 567 <DD><DL COMPACT>
 568 <DT><STRONG>cache</STRONG>
 569 <DD><A HREF="node4.html#825">The Cache</A>
 570 <DT><STRONG>SIS</STRONG>
 571 <DD><A HREF="node3.html#577">The SIS/VIS Interface</A>
 572  | <A HREF="node3.html#585">Using the CUDD Package</A>
 573 <DT><STRONG>VIS</STRONG>
 574 <DD><A HREF="node3.html#578">The SIS/VIS Interface</A>
 575 </DL>
 576 <DT><STRONG>libraries</STRONG>
 577 <DD><A HREF="node2.html#53">The CUDD Package</A>
 578 <DL COMPACT>
 579 <DT><STRONG>cudd</STRONG>
 580 <DD><A HREF="node3.html#83">Compiling and Linking</A>
 581 <DT><STRONG>dddmp</STRONG>
 582 <DD><A HREF="node3.html#691">Saving and Restoring BDDs</A>
 583 <DT><STRONG>mtr</STRONG>
 584 <DD><A HREF="node3.html#84">Compiling and Linking</A>
 585  | <A HREF="node3.html#505">Grouping Variables</A>
 586 <DT><STRONG>obj</STRONG>
 587 <DD><A HREF="node5.html#1044">Compiling and Linking</A>
 588 <DT><STRONG>st</STRONG>
 589 <DD><A HREF="node3.html#85">Compiling and Linking</A>
 590  | <A HREF="node4.html#822">The Cache</A>
 591 <DT><STRONG>util</STRONG>
 592 <DD><A HREF="node3.html#86">Compiling and Linking</A>
 593 </DL>
 594 <DT><STRONG>Makefile</STRONG>
 595 <DD><A HREF="node3.html#87">Compiling and Linking</A>
 596  | <A HREF="node3.html#221">Predefined Constants</A>
 597  | <A HREF="node5.html#1045">Compiling and Linking</A>
 598 <DT><STRONG>manager</STRONG>
 599 <DD><A HREF="node3.html#128">The Manager</A>
 600  | <A HREF="node3.html#135">The Manager</A>
 601  | <A HREF="node3.html#190">Constant Functions</A>
 602 <DT><STRONG>matrix</STRONG>
 603 <DD><DL COMPACT>
 604 <DT><STRONG>sparse</STRONG>
 605 <DD><A HREF="node3.html#240">Background</A>
 606 </DL>
 607 <DT><STRONG>maxCache</STRONG>
 608 <DD><A HREF="node4.html#842">Cache Sizing</A>
 609 <DT><STRONG>maxMemory</STRONG>
 610 <DD><A HREF="node3.html#165">Initializing and Shutting Down</A>
 611 <DT><STRONG>MinusInfinity</STRONG>
 612 <DD><A HREF="node3.html#213">Predefined Constants</A>
 613 <DT><STRONG>MTR_DEFAULT</STRONG>
 614 <DD><A HREF="node3.html#520">Grouping Variables</A>
 615 <DT><STRONG>MTR_FIXED</STRONG>
 616 <DD><A HREF="node3.html#515">Grouping Variables</A>
 617 <DT><STRONG>nanotrav</STRONG>
 618 <DD><A HREF="node2.html#59">The CUDD Package</A>
 619  | <A HREF="node2.html#63">The CUDD Package</A>
 620 <DT><STRONG>node</STRONG>
 621 <DD><A HREF="node3.html#93">Nodes</A>
 622 <DL COMPACT>
 623 <DT><STRONG>constant</STRONG>
 624 <DD><A HREF="node3.html#100">Nodes</A>
 625  | <A HREF="node3.html#188">Constant Functions</A>
 626  | <A HREF="node3.html#195">One, Logic Zero, and</A>
 627  | <A HREF="node3.html#210">Predefined Constants</A>
 628  | <A HREF="node3.html#236">Background</A>
 629  | <A HREF="node3.html#258">New Constants</A>
 630  | <A HREF="node4.html#709">Reference Counts</A>
 631  | <A HREF="node4.html#765">When Increasing the Reference</A>
 632 <DD><DL COMPACT>
 633 <DT><STRONG>value</STRONG>
 634 <DD><A HREF="node3.html#125">Nodes</A>
 635 </DL>
 636 <DT><STRONG>dead</STRONG>
 637 <DD><A HREF="node4.html#726">Reference Counts</A>
 638  | <A HREF="node4.html#816">The Cache</A>
 639  | <A HREF="node4.html#871">The Unique Table</A>
 640 <DT><STRONG>dereference</STRONG>
 641 <DD><A HREF="node3.html#344">Basic ADD Manipulation</A>
 642 <DT><STRONG>reclaimed</STRONG>
 643 <DD><A HREF="node4.html#875">The Unique Table</A>
 644 <DT><STRONG>recycling</STRONG>
 645 <DD><A HREF="node3.html#124">Nodes</A>
 646 <DT><STRONG>reference</STRONG>
 647 <DD><A HREF="node3.html#343">Basic ADD Manipulation</A>
 648 <DT><STRONG>reference count</STRONG>
 649 <DD><A HREF="node3.html#95">Nodes</A>
 650  | <A HREF="node3.html#114">Nodes</A>
 651  | <A HREF="node3.html#315">Basic BDD Manipulation</A>
 652  | <A HREF="node3.html#327">Basic BDD Manipulation</A>
 653  | <A HREF="node4.html#702">Reference Counts</A>
 654  | <A HREF="node4.html#724">Reference Counts</A>
 655  | <A HREF="node4.html#737">Reference Counts</A>
 656  | <A HREF="node4.html#763">When Increasing the Reference</A>
 657  | <A HREF="node4.html#777">Saturating Increments and Decrements</A>
 658  | <A HREF="node4.html#814">The Cache</A>
 659  | <A HREF="node4.html#855">Local Caches</A>
 660  | <A HREF="node4.html#930">Debugging</A>
 661 <DD><DL COMPACT>
 662 <DT><STRONG>saturated</STRONG>
 663 <DD><A HREF="node4.html#932">Debugging</A>
 664 </DL>
 665 <DT><STRONG>terminal</STRONG>
 666 <DD><i>see </i> node, constant
 667 <DT><STRONG>variable index</STRONG>
 668 <DD><A HREF="node3.html#94">Nodes</A>
 669 </DL>
 670 <DT><STRONG>numSlots</STRONG>
 671 <DD><A HREF="node3.html#158">Initializing and Shutting Down</A>
 672 <DT><STRONG>numVars</STRONG>
 673 <DD><A HREF="node3.html#154">Initializing and Shutting Down</A>
 674 <DT><STRONG>numVarsZ</STRONG>
 675 <DD><A HREF="node3.html#155">Initializing and Shutting Down</A>
 676 <DT><STRONG>PlusInfinity</STRONG>
 677 <DD><A HREF="node3.html#212">Predefined Constants</A>
 678  | <A HREF="node3.html#238">Background</A>
 679 <DT><STRONG>projection functions</STRONG>
 680 <DD><A HREF="node3.html#265">Creating Variables</A>
 681  | <A HREF="node3.html#268">New BDD and ADD</A>
 682  | <A HREF="node3.html#276">New BDD and ADD</A>
 683  | <A HREF="node3.html#279">New BDD and ADD</A>
 684  | <A HREF="node3.html#297">New ZDD Variables</A>
 685  | <A HREF="node3.html#314">Basic BDD Manipulation</A>
 686  | <A HREF="node3.html#342">Basic ADD Manipulation</A>
 687  | <A HREF="node3.html#359">Basic ZDD Manipulation</A>
 688  | <A HREF="node3.html#363">Basic ZDD Manipulation</A>
 689  | <A HREF="node4.html#931">Debugging</A>
 690 <DT><STRONG>README file</STRONG>
 691 <DD><A HREF="node2.html#64">The CUDD Package</A>
 692  | <A HREF="node2.html#54">The CUDD Package</A>
 693 <DT><STRONG>reordering</STRONG>
 694 <DD><A HREF="node1.html#25">Introduction</A>
 695  | <A HREF="node1.html#29">Introduction</A>
 696  | <A HREF="node3.html#102">Nodes</A>
 697  | <A HREF="node4.html#817">The Cache</A>
 698 <DL COMPACT>
 699 <DT><STRONG>abort and retry</STRONG>
 700 <DD><A HREF="node4.html#889">Allowing Asynchronous Reordering</A>
 701 <DT><STRONG>asynchronous</STRONG>
 702 <DD><A HREF="node3.html#425">Variable Reordering for BDDs</A>
 703  | <A HREF="node4.html#884">Allowing Asynchronous Reordering</A>
 704 <DT><STRONG>converging</STRONG>
 705 <DD><A HREF="node3.html#432">Variable Reordering for BDDs</A>
 706  | <A HREF="node3.html#461">Variable Reordering for BDDs</A>
 707  | <A HREF="node3.html#469">Variable Reordering for BDDs</A>
 708  | <A HREF="node3.html#482">Variable Reordering for BDDs</A>
 709 <DT><STRONG>Cudd_ReorderingType</STRONG>
 710 <DD><A HREF="node3.html#436">Variable Reordering for BDDs</A>
 711 <DT><STRONG>dynamic</STRONG>
 712 <DD><A HREF="node1.html#34">Introduction</A>
 713  | <A HREF="node3.html#417">Variable Reordering for BDDs</A>
 714  | <A HREF="node3.html#538">Variable Reordering for ZDDs</A>
 715 <DT><STRONG>exact</STRONG>
 716 <DD><A HREF="node3.html#492">Variable Reordering for BDDs</A>
 717 <DT><STRONG>function wrapper</STRONG>
 718 <DD><A HREF="node4.html#891">Allowing Asynchronous Reordering</A>
 719  | <A HREF="node4.html#906">Allowing Asynchronous Reordering</A>
 720 <DT><STRONG>genetic</STRONG>
 721 <DD><A HREF="node3.html#489">Variable Reordering for BDDs</A>
 722 <DT><STRONG>group</STRONG>
 723 <DD><A HREF="node3.html#434">Variable Reordering for BDDs</A>
 724  | <A HREF="node3.html#471">Variable Reordering for BDDs</A>
 725 <DT><STRONG>hooks</STRONG>
 726 <DD><A HREF="node3.html#569">Hooks</A>
 727 <DT><STRONG>interruptible procedure</STRONG>
 728 <DD><A HREF="node4.html#890">Allowing Asynchronous Reordering</A>
 729 <DT><STRONG>of BDDs and ADDs</STRONG>
 730 <DD><A HREF="node3.html#415">Variable Reordering for BDDs</A>
 731 <DT><STRONG>of ZDDs</STRONG>
 732 <DD><A HREF="node3.html#374">Basic ZDD Manipulation</A>
 733  | <A HREF="node3.html#530">Variable Reordering for ZDDs</A>
 734 <DT><STRONG>random</STRONG>
 735 <DD><A HREF="node3.html#447">Variable Reordering for BDDs</A>
 736 <DT><STRONG>sifting</STRONG>
 737 <DD><A HREF="node3.html#435">Variable Reordering for BDDs</A>
 738  | <A HREF="node3.html#450">Variable Reordering for BDDs</A>
 739 <DT><STRONG>simulated annealing</STRONG>
 740 <DD><A HREF="node3.html#486">Variable Reordering for BDDs</A>
 741 <DT><STRONG>symmetric</STRONG>
 742 <DD><A HREF="node3.html#463">Variable Reordering for BDDs</A>
 743 <DT><STRONG>threshold</STRONG>
 744 <DD><A HREF="node3.html#424">Variable Reordering for BDDs</A>
 745  | <A HREF="node4.html#886">Allowing Asynchronous Reordering</A>
 746 <DT><STRONG>window</STRONG>
 747 <DD><A HREF="node3.html#476">Variable Reordering for BDDs</A>
 748 </DL>
 749 <DT><STRONG>saturating</STRONG>
 750 <DD><DL COMPACT>
 751 <DT><STRONG>decrements</STRONG>
 752 <DD><A HREF="node4.html#775">Saturating Increments and Decrements</A>
 753 <DT><STRONG>increments</STRONG>
 754 <DD><A HREF="node4.html#774">Saturating Increments and Decrements</A>
 755 </DL>
 756 <DT><STRONG>SISDIR</STRONG>
 757 <DD><A HREF="node3.html#587">Using the CUDD Package</A>
 758 <DT><STRONG>SIZEOF_INT</STRONG>
 759 <DD><A HREF="node4.html#787">Saturating Increments and Decrements</A>
 760  | <A HREF="node4.html#796">Saturating Increments and Decrements</A>
 761 <DT><STRONG>SIZEOF_VOID_P</STRONG>
 762 <DD><A HREF="node4.html#786">Saturating Increments and Decrements</A>
 763  | <A HREF="node4.html#795">Saturating Increments and Decrements</A>
 764 <DT><STRONG>statistical counters</STRONG>
 765 <DD><A HREF="node3.html#137">The Manager</A>
 766  | <A HREF="node4.html#727">Reference Counts</A>
 767  | <A HREF="node4.html#846">Cache Sizing</A>
 768 <DT><STRONG>statistics</STRONG>
 769 <DD><A HREF="node4.html#934">Gathering and Interpreting Statistics</A>
 770 <DT><STRONG>subtable</STRONG>
 771 <DD><A HREF="node3.html#159">Initializing and Shutting Down</A>
 772  | <A HREF="node4.html#728">Reference Counts</A>
 773 <DT><STRONG>symmetry</STRONG>
 774 <DD><A HREF="node3.html#465">Variable Reordering for BDDs</A>
 775 <DT><STRONG>table</STRONG>
 776 <DD><DL COMPACT>
 777 <DT><STRONG>computed</STRONG>
 778 <DD><A HREF="node3.html#143">Cache</A>
 779 <DT><STRONG>growth</STRONG>
 780 <DD><A HREF="node3.html#179">Setting Parameters</A>
 781 <DT><STRONG>hash</STRONG>
 782 <DD><A HREF="node3.html#130">The Manager</A>
 783  | <A HREF="node4.html#867">The Unique Table</A>
 784 <DT><STRONG>unique</STRONG>
 785 <DD><A HREF="node3.html#96">Nodes</A>
 786  | <A HREF="node3.html#131">The Manager</A>
 787  | <A HREF="node3.html#133">The Manager</A>
 788  | <A HREF="node3.html#160">Initializing and Shutting Down</A>
 789  | <A HREF="node3.html#167">Initializing and Shutting Down</A>
 790  | <A HREF="node3.html#178">Setting Parameters</A>
 791  | <A HREF="node3.html#420">Variable Reordering for BDDs</A>
 792  | <A HREF="node4.html#729">Reference Counts</A>
 793  | <A HREF="node4.html#843">Cache Sizing</A>
 794  | <A HREF="node4.html#848">Cache Sizing</A>
 795  | <A HREF="node4.html#860">The Unique Table</A>
 796 <DD><DL COMPACT>
 797 <DT><STRONG>fast growth</STRONG>
 798 <DD><A HREF="node4.html#878">The Unique Table</A>
 799 <DT><STRONG>reward-based resizing</STRONG>
 800 <DD><A HREF="node4.html#876">The Unique Table</A>
 801 <DT><STRONG>slow growth</STRONG>
 802 <DD><A HREF="node4.html#879">The Unique Table</A>
 803 </DL>
 804 </DL>
 805 <DT><STRONG>variable</STRONG>
 806 <DD><DL COMPACT>
 807 <DT><STRONG>groups</STRONG>
 808 <DD><A HREF="node3.html#499">Grouping Variables</A>
 809 <DT><STRONG>order</STRONG>
 810 <DD><A HREF="node3.html#99">Nodes</A>
 811  | <A HREF="node3.html#284">New BDD and ADD</A>
 812 <DT><STRONG>permutation</STRONG>
 813 <DD><A HREF="node3.html#101">Nodes</A>
 814  | <A HREF="node4.html#862">The Unique Table</A>
 815 <DT><STRONG>tree</STRONG>
 816 <DD><A HREF="node3.html#501">Grouping Variables</A>
 817  | <A HREF="node3.html#524">Grouping Variables</A>
 818 </DL>
 819 <DT><STRONG>ZDD</STRONG>
 820 <DD><A HREF="node1.html#18">Introduction</A>
 821  | <A HREF="node3.html#117">Nodes</A>
 822  | <A HREF="node3.html#295">New ZDD Variables</A>
 823  | <A HREF="node3.html#355">Basic ZDD Manipulation</A>
 824  | <A HREF="node3.html#396">Converting BDDs to ZDDs</A>
 825 <DT><STRONG>zero</STRONG>
 826 <DD><DL COMPACT>
 827 <DT><STRONG>arithmetic</STRONG>
 828 <DD><A HREF="node3.html#193">One, Logic Zero, and</A>
 829  | <A HREF="node3.html#272">New BDD and ADD</A>
 830  | <A HREF="node3.html#389">Converting ADDs to BDDs</A>
 831 <DT><STRONG>logical</STRONG>
 832 <DD><A HREF="node3.html#192">One, Logic Zero, and</A>
 833  | <A HREF="node3.html#388">Converting ADDs to BDDs</A>
 834 </DL>
 835 <DT><STRONG>Zero-suppressed Binary Decision Diagram</STRONG>
 836 <DD><i>see </i> ZDD
 837
 838 </DL>
 839 <BR><HR>
 840 <ADDRESS>
 841 Fabio Somenzi
 842 2009-02-20
 843 </ADDRESS>
 844 </BODY>
 845 </HTML>