Search Results for ""

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

The three circles theorem, also called Hadamard's three circles theorem (Edwards 2001, p. 187), states that if f is an analytic function in the annulus 0<r_1<|z|<r_2<infty, ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

The rectangle function Pi(x) is a function that is 0 outside the interval [-1/2,1/2] and unity inside it. It is also called the gate function, pulse function, or window ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A (-1,1)-matrix is a matrix whose elements consist only of the numbers -1 or 1. For an n×n (-1,1)-matrix, the largest possible determinants (Hadamard's maximum determinant ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...