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

Project Activity

See All Activity >

License

GNU General Public License version 3.0 (GPLv3)

Follow QFT fork-yzhs

QFT fork-yzhs Web Site

Other Useful Business Software
Paessler - Monitor Your Whole Network in Minutes Icon
Paessler - Monitor Your Whole Network in Minutes

Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
Start Free 30-Day Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of QFT fork-yzhs!

Additional Project Details

Operating Systems

Linux

User Interface

Command-line

Programming Language

C++

Related Categories

C++ Scientific Engineering

Registered

2024-08-28