Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable...
    46 KB (4,371 words) - 23:30, 22 May 2025
  • is a string-searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find an exact match of a pattern string in a...
    14 KB (1,976 words) - 00:08, 1 April 2025
  • Thumbnail for Hash function
    reduced by a final modulo or other operation to yield an index into the table. Analogous to the way an ASCII or EBCDIC character string representing a decimal...
    50 KB (7,455 words) - 21:00, 27 May 2025
  • Thumbnail for Concatenation
    concatenation theory, also called string theory, string concatenation is a primitive notion. In many programming languages, string concatenation is a binary infix...
    9 KB (1,007 words) - 23:34, 19 May 2025
  • Check digit (redirect from Check string)
    check digit method would be to take the sum of all digits (digital sum) modulo 10. This would catch any single-digit error, as such an error would always...
    19 KB (2,632 words) - 12:50, 27 May 2025
  • String functions are used in computer programming languages to manipulate a string or query information about a string (some do both). Most programming...
    125 KB (4,077 words) - 12:50, 22 February 2025
  • Bosonic string theory is the original version of string theory, developed in the late 1960s. It is so called because it contains only bosons in the spectrum...
    13 KB (1,596 words) - 13:49, 8 March 2025
  • In physics, a Dirac string is a one-dimensional curve in space, conceived of by the physicist Paul Dirac, stretching between two hypothetical Dirac monopoles...
    3 KB (405 words) - 16:55, 11 April 2025
  • Thumbnail for Code 128
    weight in the barcode string. The start symbol and first encoded symbol are in position 1. The sum of the products is then reduced modulo 103. The remainder...
    24 KB (2,516 words) - 01:48, 28 May 2025
  • simply saying that we may first reduce a modulo p. This is consistent with reducing a p {\displaystyle a^{p}} modulo p, as one can check. Secondly, it suffices...
    36 KB (4,822 words) - 17:09, 19 February 2025
  • Thumbnail for Computation of cyclic redundancy checks
    mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended...
    58 KB (5,698 words) - 12:51, 26 May 2025
  • beginning of an Adler-32 run, A is initialized to 1, B to 0. The sums are done modulo 65521 (the largest prime number smaller than 216). The bytes are stored...
    10 KB (887 words) - 15:40, 25 August 2024
  • Opcode (redirect from Operation string)
    Łukasz (2012). "7.1.4. Benchmark suite". Application of CLP to instruction modulo scheduling for VLIW processors. Gliwice, Poland: Jacek Skalmierski Computer...
    17 KB (1,169 words) - 18:27, 18 March 2025
  • Thumbnail for International Bank Account Number
    in use does not provide the ability to handle integers of this size, the modulo operation can be performed in a piece-wise manner (as is the case with the...
    80 KB (4,994 words) - 14:38, 21 May 2025
  • Thumbnail for Sine and cosine
    advantage and efficiency advantage for computing modulo to one period. Computing modulo 1 turn or modulo 2 half-turns can be losslessly and efficiently...
    55 KB (7,064 words) - 00:33, 30 May 2025
  • private FName: string; public property Name: string read FName; constructor Create(AName: string); end; constructor TPerson.Create(AName: string); begin FName...
    35 KB (4,271 words) - 04:13, 29 May 2025
  • Thumbnail for Fibonacci word
    Fibonacci word may be obtained by taking the sequence of fibbinary numbers modulo 2. Fibonacci based constructions are currently used to model physical systems...
    14 KB (1,938 words) - 20:16, 18 May 2025
  • Thumbnail for Circle of fifths
    represented by the cyclic group of order N, or equivalently, the residue classes modulo equal to N, Z / N Z {\displaystyle \mathbb {Z} /N\mathbb {Z} } . In twelve-tone...
    48 KB (3,936 words) - 14:14, 24 May 2025
  • The check digit is then calculated by: [10 − (126 modulo 10)] modulo 10 = (10 − 6) modulo 10 = 4 modulo 10 = 4 "SEDOL Masterfile - Service & Technical Guide"...
    4 KB (612 words) - 01:39, 16 November 2024
  • integers modulo 2). That is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around. Any string of bits...
    22 KB (3,951 words) - 22:01, 7 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)