The following pages link to (Q3742714):
Displayed 7 items.
- On O(Tlog T) reduction from RAM computations to satisfiability (Q758197) (← links)
- Short propositional formulas represent nondeterministic computations (Q1096390) (← links)
- Functions computed by monotone Boolean formulas with no repeated variables (Q1121854) (← links)
- A linear time equivalence test for read-twice DNF formulas (Q1334630) (← links)
- On path equivalence of nondeterministic finite automata (Q1351166) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- The read once formula of a series-parallel network (Q2166241) (← links)