The following pages link to (Q4138141):
Displayed 36 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- A consideration of a practical implementation for a new convergence division (Q1055188) (← links)
- Data subset selection by Boolean calculation (Q1057787) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity (Q1076669) (← links)
- More on the complexity of slice functions (Q1079365) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Models of lower-bounds proofs (Q1107322) (← links)
- A lower bound for read-once-only branching programs (Q1107323) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Entropy of contact circuits and lower bounds on their complexity (Q1109754) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- Meanders and their applications in lower bounds arguments (Q1115606) (← links)
- Functions computed by monotone Boolean formulas with no repeated variables (Q1121854) (← links)
- Switching functions whose monotone complexity is nearly quadratic (Q1133519) (← links)
- Displacement ranks of matrices and linear equations (Q1139102) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- On the complexity of 2-output Boolean networks (Q1159183) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754) (← links)
- Relating monotone formula size and monotone depth of Boolean functions (Q1835900) (← links)
- Randomised algorithms (Q1836980) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Probabilistic parallel prefix computation (Q2367585) (← links)