Pages that link to "Item:Q2628281"
From MaRDI portal
The following pages link to Computing the permanent modulo a prime power (Q2628281):
Displaying 10 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
- Computing sparse permanents faster (Q1044712) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
- (Q5111865) (← links)
- Below all subsets for some permutational counting problems (Q5369519) (← links)
- Enumerative and structural aspects of anagrams without fixed letters (Q6659946) (← links)