The following pages link to Hyper-Minimization in O(n 2) (Q3602817):
Displaying 7 items.
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← links)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012) (← links)
- (Q5015284) (← links)
