On the computational power of linearly transformed BDDs

DOI10.1016/S0020-0190(00)00083-1zbMath1338.68073WikidataQ59243039 ScholiaQ59243039MaRDI QIDQ294813

Rolf Drechsler, Wolfgang Günther

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000831?np=y

zbMATH Keywords

linear transformationdata structurescomputational powerBDD

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Lower bounds for linearly transformed OBDDs and FBDDs

Cites Work

• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation