Reduction of OBDDs in linear time
From MaRDI portal
Publication:1313758
DOI10.1016/0020-0190(93)90256-9zbMath0787.94027OpenAlexW2090233333WikidataQ127723507 ScholiaQ127723507MaRDI QIDQ1313758
Publication date: 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90256-9
verificationordered binary decision diagramstest pattern generationdata structure for Boolean functions
Related Items
Parity OBDDs cannot be handled efficiently enough, Weighted \(A^*\) search - unifying view and application, Efficient data structures for Boolean functions, On the hardness of approximating the minimum consistent OBDD problem, Binary Decision Diagrams, A reducibility concept for problems defined in terms of ordered binary decision diagrams, String-matching with OBDDs, Exponential space complexity for OBDD-based reachability analysis, On the complexity of constructing optimal ordered binary decision diagrams, On symbolic OBDD-based algorithms for the minimum spanning tree problem, Priority functions for the approximation of the metric TSP, Linear temporal logic symbolic model checking, BDDs -- design, analysis, complexity, and applications., Graph driven BDDs -- a new data structure for Boolean functions, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems, Larger lower bounds on the OBDD complexity of integer multiplication, Minimization problems for parity OBDDs, A reducibility concept for problems defined in terms of ordered binary decision diagrams, On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem, On the size of (generalized) OBDDs for threshold functions, Exact OBDD Bounds for Some Fundamental Functions, On the descriptive and algorithmic power of parity ordered binary decision diagrams, Non-clausal redundancy properties, The symbolic OBDD scheme for generating mechanical assembly sequences, On the relation between BDDs and FDDs, Bounds on the OBDD-size of integer multiplication via universal hashing, On the descriptive and algorithmic power of parity ordered binary decision diagrams
Cites Work
