Pages that link to "Item:Q1275090"

The following pages link to Using fast matrix multiplication to find basic solutions (Q1275090):

Displaying 9 items.

• An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
• Approximation schemes for packing with item fragmentation (Q927410) (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) (← links)
• Fast rectangular matrix multiplication and applications (Q1271174) (← links)
• (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
• Finding mixed strategies with small supports in extensive form games (Q1814784) (← links)
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
• Fully dynamic bin packing revisited (Q2288188) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)