Pages that link to "Item:Q2467342"
From MaRDI portal
The following pages link to On the complexity of matrix reduction over finite fields (Q2467342):
Displaying 10 items.
- Reduction of matrices over orders of imaginary quadratic fields (Q551313) (← links)
- Cutoff for product replacement on finite groups (Q783793) (← links)
- Cutoff for a stratified random walk on the hypercube (Q1663741) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- An average John theorem (Q2048458) (← links)
- Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
- Reducing the number of operations in certain finite- field transforms (Corresp.) (Q3329388) (← links)
- Smallest Reduction Matrix of Binary Quadratic Forms (Q4931639) (← links)
- (Q5002632) (← links)
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629) (← links)