Pages that link to "Item:Q2013543"
From MaRDI portal
The following pages link to On the complexity of the permanent in various computational models (Q2013543):
Displaying 11 items.
- Binary determinantal complexity (Q286175) (← links)
- Geometric complexity theory and matrix powering (Q1679673) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- The Hafnian master theorem (Q2158281) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- Expressing polynomials as the permanent of low rank square matrices (Q2883553) (← links)
- (Q3067455) (← links)
- A quadratic bound for the determinant and permanent problem (Q4661386) (← links)
- Succinct Permanent Is NEXP-Hard with Many Hard Instances (Q4924648) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
