This is a fork of Colin Benner's Frobenius benchmarking.
https://github.com/yzhs/frobenius-test
Quadratic Frobenius primality Test (QFT) as devised by Grantham has two relatively expensive first steps. In other projects, techniques were examined that may reduce that expense and are tested here.
Features
- g++ (gcc version 13.2)
- GMP 6.3
- Intel OneApi TBB 2021.13
Categories
Scientific/EngineeringLicense
GNU General Public License version 3.0 (GPLv3)Follow QFT fork-yzhs
Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of QFT fork-yzhs!