| 1.
| 2-3 tree -
Metadata - Content
Description: A ... 2-3 tree is a B-tree of order 3, that is, internal nodes have two or three children. ...more |
| 2.
| Ackermann function -
Metadata - Content
Description: Ackermann's function ... is defined by the recurrence relations ... Ackermann's function is an example of a recursive function that is not primitive recursive, but is instead mu-recursive (that is, Tu...more |
| 3.
| Amdahl's Law -
Metadata - Content
Description: Amdahl's Law reveals the maximum speedup that can be expected from parallel algorithms given the proportion of parts that must be computed sequentially. It gives the speedup <i>S</i> as ... Where <i>f...more |
| 4.
| B-spline -
Metadata - Content
Description: ... Let ... be a sequence of nondecreasing real numbers ( ... ). For each <i>i</i>, we recursively define a set of real-valued functions ... (for ... ) as follows: ... where ... Definitions . Using th...more |
| 5.
| B-tree -
Metadata - Content
Description: A ... B-tree of <i>m</i> is a BalancedTree search tree in which ... every node has at most <i>m</i> children, ... every node, other than a root or leaf, has at least ... children, ... the root has at ...more |
| 6.
| BASIC -
Metadata - Content
Description: ... BASIC (an acronym for ... Beginner's All-purpose Symbolic Instruction Code ) is a computer procedure-oriented programming language designed by John Kemeny and Thomas Kurtz in the 1960s to be easil...more |
| 7.
| BB(alpha) tree -
Metadata - Content
Description: A ... tree is a binary tree where the balance of every subtree, ... , is bounded by ... . ...more |
| 8.
| Backus-Naur form -
Metadata - Content
Description: The ... Backus-Naur form (or ... BNF as it is commonly denoted) is a convenient notation used to represent context-free grammars in an intuitive and more compact manner. In a Backus-Naur form, there a...more |
| 9.
| Bernstein polynomial -
Metadata - Content
Description: The ... Bernstein polynomials of <i>n</i> are defined by ... where ... is the binomial coefficient. ... Bernstein polynomials are used extensively in interpolation theory and in computer graphics. The...more |
| 10.
| Boolean domain -
Metadata - Content
Description: A ... Boolean domain ... is a generic 2-element set, say, ... , whose elements are interpreted as logical values, typically, ... and ... . A ... Boolean variable <i>x</i> is a variable that takes its ...more |
| 11.
| Boolean operations on automata -
Metadata - Content
Description: A Boolean operation is any one of the three set-theoretic operations: union, intersection, and complementation. Boolean operations on automata are operations defined on automata resembling those from ...more |
| 12.
| Boolean-valued function -
Metadata - Content
Description: A ... Boolean-valued function is a function of type ... , where <i>X</i> is an arbitrary set and where ... is a Boolean domain. A ... Boolean function (of finite arity <i>k</i>) is a Boolean-valued fu...more |
| 13.
| Briggsian logarithms -
Metadata - Content
Description: The ... Briggsian logarithm of a positive number <i>a</i> is the logarithm of <i>a</i> in the base 10, i.e. ... , nowadays denoted by ... (probably from the Latin ... ).\, The is due to Henry Briggs (...more |
| 14.
| C -
Metadata - Content
Description: ... C is a procedural compiled programming language devised by Dennis Ritchie at the Bell Labs in New Jersey in 1972, and standardized in 1983 by ANSI and again by ISO in 1999. The original purpose of...more |
| 15.
| C++ -
Metadata - Content
Description: ... ++ is a compiled multi-paradigm programming language based on C that supports procedural, object-oriented and generic programming paradigms. It was developed by Bjarne Stroustrup at Bell Labs in 1...more |
| 16.
| Cantor-Zassenhaus split -
Metadata - Content
Description: Assume we want to factor a polynomial ... , where <i>p</i> is a prime and ... is the field with <i>p</i> elements. By using squarefree factorization we can assume that <i>A</i> is squarefree. The algo...more |
| 17.
| Chomsky hierarchy -
Metadata - Content
Description: The ... Chomsky hierarchy or ... Chomsky-Sch\"utzenberger hierarchy is a way of classifying formal grammars into four types, with the lower numbered types being more general. Recall that a formal gram...more |
| 18.
| Chomsky normal form -
Metadata - Content
Description: A grammar is said to be of ... Chomsky normal form if every production has either of the two forms ... where ... are non-terminal symbols, and <i>a</i> is a terminal symbol. Grammars of this sort are ...more |
| 19.
| Chomsky-Sch\"utzenberger theorem -
Metadata - Content
Description: An important characterization of context-free languages is captured in what is known as the Chomsky-Sch\"utzenberger theorem. It shows the intimate connection between context-free and parenthesis lang...more |
| 20.
| Church integer -
Metadata - Content
Description: A ... Church integer is a representation of integers as functions, invented by Alonzo Church. An integer <i>N</i> is represented as a higher-order function, which applies a given function to a given e...more |
