You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This code was written to ensure there are no collisions among the SHA256 hashes gotten from numeric strings in the range of 0000 000 000 to 9999 999 999
This package (non-exactly) maximizes the total prize with a budget constraint for an undirected node-weighted rooted graph loosely inspired by Bateni 2018 algorithm from DOI:10.1137/15M102695X
Gives analytic formulas to calculate autocovariance matrix and autocorrelation matrix for averaged Wiener process with equal-distance time points. Is supplemented with Python numpy code to verify t…
This is an implementation of Dabbaghian & Wu's algorithm of constructing non-cyclic pandiagonal Latin squares for the order 13 from Dabbaghian V, Wu T. Constructing non-cyclic pandiagonal Latin squ…
HTML
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page
or contact support.