fbdd (378B)
1 # FBDD 2 3 Free [BDD], i.e., the [variables] are not [ordered] but every [path] in the [BDD] encounters any given [variable] at most once 4 5 Is a subclass of [DNNF] 6 7 Can be [circuit_negated] in [PTIME] by swapping the [sinks] 8 9 Generalizations: 10 11 - [uFBDD] 12 - [nFBDD] 13 14 [Computational_problems]: 15 16 - [FBDD_equivalence] 17 18 Up: [bdd] 19 20 Aliases: FBDDs 21 22 See also: [read_twice_branching_program]