Lattice enumeration: O(R^N) complexity reduced to O(R^2) with no floating point

Lattice enumeration: O(R^N) complexity reduced to O(R^2) with no floating point github.com

Source code and benchmarks for the integer-only orthotropic lattice enumeration framework and discrete rational π convergence. - Andrew-J-Morris/orthotropic-parity-and-discrete-pi

2 points•MorrisAndrewJ•11 days ago•0 comments•

#lattice #enumeration #lattice enumeration #complexity #floating #reduced #point #complexity reduced

0 comments

No comments yet.

Read the full thread on Hacker News →

0 comments

Related stories