Pages that link to "Item:Q1951581"
From MaRDI portal
The following pages link to Permanent does not have succinct polynomial size arithmetic circuits of constant depth (Q1951581):
Displaying 6 items.
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Marginal hitting sets imply super-polynomial lower bounds for permanent (Q2826080) (← links)
- The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent (Q2911618) (← links)
- Succinct Permanent Is NEXP-Hard with Many Hard Instances (Q4924648) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)