On the Input Problem for Massive Modularity
โ Scribed by J. Collins
- Book ID
- 106466849
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 254 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0924-6495
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Heden, O., On the modular n-queen problem, Discrete Mathematics 102 (1992) 155-161. Let M(n) denote the maximum number of queens on a modular chessboard such that no two attack each other. We prove that if 4 or 6 divides n then M(n) c n -2 and if gcd(n, 24) = 8 then M(n) 2 n -2. We also show that M
We describe the use of the Massively Parallel Processor for certain large-scale scientific computations. Methods and performances are discussed for matrix calculations, tridiagonal and cyclic tridiagonal systems, iterative solution of discretized elliptic equations, the driven cavity problem and the