Pages that link to "Item:Q1430572"
From MaRDI portal
The following pages link to On the hardness of approximating the permanent of structured matrices (Q1430572):
Displaying 4 items.
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- A hidden number problem in small subgroups (Q5315437) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)