Pages that link to "Item:Q1263283"
From MaRDI portal
The following pages link to A note on the determinant and permanent problem (Q1263283):
Displaying 21 items.
- Binary determinantal complexity (Q286175) (← links)
- A note on perfect partial elimination (Q389218) (← links)
- On the Pólya conversion problem for permanents and determinants (Q459468) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- Quadratic lower bound for permanent vs. determinant in any characteristic (Q623498) (← links)
- Solutions to two problems on permanents (Q648918) (← links)
- Permanent and determinant (Q1097929) (← links)
- On two extremal matrix problems (Q1115936) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry (Q2800550) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- On Leonid Gurvits’s Proof for Permanents (Q3069248) (← links)
- (Q3325022) (← links)
- Are there elimination algorithms for the permanent? (Q4033465) (← links)
- A quadratic bound for the determinant and permanent problem (Q4661386) (← links)
- (Q5491021) (← links)