Pages that link to "Item:Q1355377"
From MaRDI portal
The following pages link to On the hardness of computing the permanent of random matrices (Q1355377):
Displayed 7 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Limit theorems for random permanents with exchangeable structure (Q1888330) (← links)
- Some upper bounds for permanents of (0, 1)-matrices (Q3511473) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)