Lower Bounds for Linear Transformed OBDDs and FBDDs

@article{Sieling1999LowerBF,
  title={Lower Bounds for Linear Transformed OBDDs and FBDDs},
  author={Detlef Sieling},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={1999},
  volume={6}
}
Linear Transformed Ordered Binary Decision Diagrams (LTOBDDs) have been suggested as a generalization of OBDDs for the representation and manipulation of Boolean functions. Instead of variables as in the case of OBDDs parities of variables may be tested at the nodes of an LTOBDD. By this extension it is possible to represent functions in polynomial size that do not have polynomial size OBDDs, e.g., the characteristic functions of linear codes. In this paper lower bound methods for LTOBDDs and… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Similar Papers

Loading similar papers…