scientific article
From MaRDI portal
Publication:3742714
zbMath0605.68030MaRDI QIDQ3742714
Richard E. Stearns, Harry B. III Hunt
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
binary decision diagramsprogram schemescomplexities of decision problemscomputational probability and counting
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
A linear time equivalence test for read-twice DNF formulas ⋮ Short propositional formulas represent nondeterministic computations ⋮ On path equivalence of nondeterministic finite automata ⋮ The read once formula of a series-parallel network ⋮ Functions computed by monotone Boolean formulas with no repeated variables ⋮ Learning from examples with unspecified attribute values. ⋮ On O(Tlog T) reduction from RAM computations to satisfiability
