On the complexity of solving linear congruences and computing nullspaces modulo a constant.
Niel de BeaudrapPublished in: Chic. J. Theor. Comput. Sci. (2013)
Keyphrases
- convex quadratic programming
- quadratic programming
- linear complexity
- special case
- computational cost
- data sets
- inverse problems in image processing
- worst case
- optimization problems
- set of linear equations
- piecewise linear
- space complexity
- linear programming
- lower bound
- data structure
- objective function
- information systems
- data mining