(1) Any function which is a constant times the argument plus a constant: f(x)=c₁x + c₀. (2) In complexity theory, the measure of computation, m(n) (usually execution time or memory space), is bounded by a linear function of the problem size, n. More formally m(n) = O(n).