Publication | Closed Access
Lower Bounds for Constant Multiplication Problems
109
Citations
30
References
2007
Year
Computational Complexity TheoryEngineeringLower BoundAnalysis Of AlgorithmComputational ComplexityTime ComplexityComputer ScienceDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationDiscrete OptimizationApproximation TheoryLower Bounds
Lower bounds for problems related to realizing multiplication by constants with shifts, adders, and subtracters are presented. These lower bounds are straightforwardly calculated and have applications in proving the optimality of solutions obtained by heuristics.
| Year | Citations | |
|---|---|---|
Page 1
Page 1