Search results

Jump to navigation Jump to search
  • In mathematics, the '''Zassenhaus algorithm'''<ref>{{citation | journal = Journal of Symbolic Computation ...
    7 KB (1,032 words) - 22:27, 13 January 2024
  • {{Short description|Prime number of the form that allows fast modular reduction}} ...isbn = 978-1-4419-5905-8}}</ref> These primes allow fast modular reduction algorithms and are widely used in [[cryptography]]. They are named after Jerome Solina ...
    4 KB (703 words) - 18:45, 20 April 2024
  • ...ial dynamic programming''' ('''DDP''') is an [[optimal control]] algorithm of the [[trajectory optimization]] class. The algorithm was introduced in 196 | title = A second-order gradient method of optimizing non-linear discrete time systems ...
    13 KB (1,963 words) - 00:11, 18 June 2024
  • {{Short description|Methods of safely sharing general data}} ...ial_privacy_informal_definition.png|thumb|440x440px|An informal definition of differential privacy]] ...
    40 KB (5,735 words) - 18:35, 7 February 2025
  • ...cer|CEO]] for both companies. The company launched [[DeepSeek (chatbot)|an eponymous chatbot]] alongside its DeepSeek-R1 model in January 2025. ...rld-western|newspaper=[[The Guardian]]}}</ref> and approximately one-tenth of the computing power used for [[Meta Platforms|Meta]]'s comparable model, [[ ...
    56 KB (7,447 words) - 03:34, 3 March 2025
  • {{Short description|Sums of sets of vectors are nearly convex}} ...sets—two points in two non-convex sets plus two points in the convex hulls of two sets. The convex hulls are shaded pink. The original sets each have ex ...
    83 KB (12,370 words) - 16:31, 26 February 2025