Computer performance is characterized by the amount of useful work accomplished by a computer system compared to the time and resources used.
more from Wikipedia
Common subexpression elimination
In computer science, common subexpression elimination (CSE) is a compiler optimization that searches for instances of identical expressions (i.e. , they all evaluate to the same value), and analyses whether it is worthwhile replacing them with a single variable holding the computed value.
more from Wikipedia
Greedy algorithm
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. On some problems, a greedy strategy need not produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution.
more from Wikipedia
NP (complexity)
In computational complexity theory, NP is one of the most fundamental complexity classes. The abbreviation NP refers to "nondeterministic polynomial time. " Intuitively, NP is the set of all decision problems for which the instances where the answer is "yes" have efficiently verifiable proofs of the fact that the answer is indeed "yes. " More precisely, these proofs have to be verifiable in polynomial time by a deterministic Turing machine.
more from Wikipedia
Pipeline (computing)
In computing, a pipeline is a set of data processing elements connected in series, so that the output of one element is the input of the next one. The elements of a pipeline are often executed in parallel or in time-sliced fashion; in that case, some amount of buffer storage is often inserted between elements.
more from Wikipedia
Algorithm
In mathematics and computer science, an algorithm Listen/ˈælɡərɪðəm/ (originating from al-Khwārizmī, the famous mathematician Muḥammad ibn Mūsā al-Khwārizmī) is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning. More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
more from Wikipedia
Necessity and sufficiency
In logic, necessity and sufficiency refer to the implicational relationships between statements. The assertion that one statement is a necessary and sufficient condition of another means that the former statement is true if and only if the latter is true.
more from Wikipedia
Mathematical model
A mathematical model is a description of a system using mathematical concepts and language. The process of developing a mathematical model is termed mathematical modelling. Mathematical models are used not only in the natural sciences and engineering disciplines, but also in the social sciences; physicists, engineers, statisticians, operations research analysts and economists use mathematical models most extensively.
more from Wikipedia