• Big O notation - Wikipedia, the free encyclopedia
  In computer science, big O notation is used to classify algorithms by how they respond to changes in input size, such as how the processing time of an algorithm changes as the problem size becomes extremely large.[3] In analytic number theory it is used to estimate the "error committed" while replacing the asymptotic size of an arithmetical function by the value it takes at a large finite argument. A famous example is the problem of estimating the remainder term in the prime number theorem.
  in Software Engineering with algorithm algorithms classify computer notation processing science theory
• Theory of Constraints
  The Theory of Constraints takes a scientific approach to improvement. It hypothesizes that every complex system, including manufacturing processes, consists of multiple linked activities, one of which acts as a constraint upon the entire system (i.e. the constraint activity is the “weakest link in the chain”).
  in Oracle > Optimization with bottleneck constraint constraints improvment process production theory

theory from all users