Logo
Explore Help
Sign In
mlemanczyk/even-perfect-numbers-scanner
Watch 1
Star 0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
1,044 Commits 19 Branches 0 Tags
e97ea151e1b6891e3806ff5cae0a59efc0563dce
Commit Graph
7 Commits
Author SHA1 Message Date
mlemanczyk e97ea151e1 BitContradiction performance improvement introducing early cut-off based on required active rows count. 2026-01-13 13:21:07 +01:00
mlemanczyk 09945544fc BitContradiction improvements to process bit 1 RLEs instead of separate indexes of each bit. 2026-01-13 12:38:06 +01:00
mlemanczyk 047e3d6233 BitContradiction performance improvements. 2026-01-13 09:59:07 +01:00
mlemanczyk e738ee29e0 BitContradiction performance improvements. 2026-01-13 09:38:34 +01:00
mlemanczyk 12c477b1a2 BitContradiction improvements to be aware of the highest "a" bit being 1 and of the minimum and maximum "a" bit length. 2026-01-13 06:56:08 +01:00
mlemanczyk d0dbb8f92a BitContradiction solvers improvements to increase early exclusions. 2026-01-13 04:20:34 +01:00
mlemanczyk bf93bcff1a BitContradictionSolverWithQMultiplier improvements. BitContradictionSolverWithAMultiplier added. 2026-01-12 20:50:54 +01:00
Powered by Gitea Version: 28.2.0 Page: 140ms Template: 5ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API