Pages that link to "Item:Q4312420"
From MaRDI portal
The following pages link to A Uniform Circuit Lower Bound for the Permanent (Q4312420):
Displaying 11 items.
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Dual VP classes (Q2410687) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
