scientific article; zbMATH DE number 3594626

zbMath0382.68021MaRDI QIDQ4160379

Steven Fortune, John E. Hopcrofts, Erik Meineche Schmidt

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

The complexity of minimizing and learning OBDDs and FBDDs, On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs, A linear time equivalence test for read-twice DNF formulas, Efficient data structures for Boolean functions, A lower bound for read-once-only branching programs, On the complexity of constructing optimal ordered binary decision diagrams, Learning ordered binary decision diagrams, Equivalence of free Boolean graphs can be decided probabilistically in polynomial time, Learning from examples with unspecified attribute values., Linear temporal logic symbolic model checking, On the size of binary decision diagrams representing Boolean functions, Graph driven BDDs -- a new data structure for Boolean functions, On the minimization of (complete) ordered binary decision diagrams, Probabilistic verification of Boolean functions, A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy, On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem, Restrictive Acceptance Suffices for Equivalence Problems