About the Project

pseudoprime test

AdvancedHelp

(0.001 seconds)

11—20 of 27 matching pages

11: Philip J. Davis
This immediately led to discussions among some of the project members about what might be possible, and the discovery that some interactive graphics work had already been done for the NIST Matrix Market, a publicly available repository of test matrices for comparing the effectiveness of numerical linear algebra algorithms. …
12: 1.10 Functions of a Complex Variable
M -test
M -test
13: 2.6 Distributional Methods
2.6.11 f , ϕ = 0 f ( t ) ϕ ( t ) d t , ϕ 𝒯 .
2.6.12 t α , ϕ = 0 t α ϕ ( t ) d t , ϕ 𝒯 ,
2.6.13 t s α , ϕ = 1 ( α ) s 0 t α ϕ ( s ) ( t ) d t , ϕ 𝒯 ,
2.6.14 t s 1 , ϕ = 1 s ! 0 ( ln t ) ϕ ( s + 1 ) ( t ) d t , ϕ 𝒯 .
2.6.19 δ ( s ) , ϕ = ( 1 ) s ϕ ( s ) ( 0 ) , s = 0 , 1 , 2 , ;
14: Bibliography P
  • M. D. Perlman and I. Olkin (1980) Unbiasedness of invariant tests for MANOVA and other multivariate problems. Ann. Statist. 8 (6), pp. 1326–1341.
  • Prime Pages (website)
  • 15: Software Index
    Open Source With Book Commercial
    4.48(v) Testing
  • Commercial Software.

    Such software ranges from a collection of reusable software parts (e.g., a library) to fully functional interactive computing environments with an associated computing language. Such software is usually professionally developed, tested, and maintained to high standards. It is available for purchase, often with accompanying updates and consulting support.

  • 16: Bibliography B
  • D. K. Bhaumik and S. K. Sarkar (2002) On the power function of the likelihood ratio test for MANOVA. J. Multivariate Anal. 82 (2), pp. 416–421.
  • W. Bosma and M.-P. van der Hulst (1990) Faster Primality Testing. In Advances in Cryptology—EUROCRYPT ’89 Proceedings, J.-J. Quisquater and J. Vandewalle (Eds.), Lecture Notes in Computer Science, Vol. 434, New York, pp. 652–656.
  • D. M. Bressoud (1989) Factorization and Primality Testing. Springer-Verlag, New York.
  • 17: Bibliography M
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • N. W. McLachlan (1934) Loud Speakers: Theory, Performance, Testing and Design. Oxford University Press, New York.
  • J. Morris (1969) Algorithm 346: F-test probabilities [S14]. Comm. ACM 12 (3), pp. 184–185.
  • 18: 1.9 Calculus of a Complex Variable
    Weierstrass M -test
    19: Bibliography C
  • W. J. Cody (1993a) Algorithm 714: CELEFUNT – A portable test package for complex elementary functions. ACM Trans. Math. Software 19 (1), pp. 1–21.
  • W. J. Cody (1993b) Algorithm 715: SPECFUN – A portable FORTRAN package of special function routines and test drivers. ACM Trans. Math. Software 19 (1), pp. 22–32.
  • 20: Bibliography E
  • ECMNET Project (website)