Pages that link to "Item:Q3012845"
From MaRDI portal
The following pages link to Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845):
Displayed 3 items.
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)