The following pages link to (Q3236503):
Displaying 20 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Biclique covers and partitions (Q405095) (← links)
- Calculating optimal addition chains (Q644848) (← links)
- The complexity of the realization of subdefinite matrices by gate schemes (Q1101066) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (Q1641147) (← links)
- On the number of ANDs versus the number of ORs in monotone Boolean circuits (Q1847364) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- On algorithm complexity (Q2453388) (← links)
- Correcting closures in contact circuits (Q2534413) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Comparing the sizes of nondeterministic branching read-k-times programs (Q4268146) (← links)
- Rectifier Circuits of Bounded Depth (Q4553646) (← links)
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs (Q4571950) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
