Pages that link to "Item:Q1679901"
From MaRDI portal
The following pages link to On the relative power of reduction notions in arithmetic circuit complexity (Q1679901):
Displaying 8 items.
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- (Q2778836) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- (Q5092463) (← links)
- Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity (Q5277654) (← links)
- (Q5748361) (← links)
- Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)