The following pages link to Permanent and determinant (Q1097929):
Displaying 14 items.
- Permanent versus determinant over a finite field (Q378689) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- On two extremal matrix problems (Q1115936) (← links)
- A note on the determinant and permanent problem (Q1263283) (← 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)
- Arithmetic matrix operations that preserve conversion (Q2255512) (← links)
- Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
- A lower bound for the determinantal complexity of a hypersurface (Q2362290) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
