Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > JAN KÁRA:
All reports by Author Jan Kára:

TR03-061 | 29th August 2003
Jan Kára, Daniel Král

Free Binary Decision Diagrams for Computation of EAR_n

Free binary decision diagrams (FBDDs) are graph-based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested at most once during the computation. The function EAR_n is the following Boolean function defined
for n x n Boolean matrices: EAR_n(M)=1 iff the matrix ... more >>>




ISSN 1433-8092 | Imprint