Pages that link to "Item:Q1802063"
From MaRDI portal
The following pages link to Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063):
Displaying 7 items.
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
