Pages that link to "Item:Q910215"
From MaRDI portal
The following pages link to Bounds on the size of test sets for sorting and related networks (Q910215):
Displaying 7 items.
- Optimal-depth sorting networks (Q340576) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Bounds on the size of merging networks (Q1897347) (← links)
- Study of the bounds on the number of basic sets in a test. (Q2756405) (← links)