Pages that link to "Item:Q2826080"
From MaRDI portal
The following pages link to Marginal hitting sets imply super-polynomial lower bounds for permanent (Q2826080):
Displaying 6 items.
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth (Q1951581) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)