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
Cloud-based help desk software with ServoDesk
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of QFT fork-yzhs!