Unverified50% confidenceFactExact time
The divsteps algorithm was originally proposed by Bernstein and Yang in 2019; it is an iterative method for computing polynomial greatest common divisors and modular inverses, involving only additions, subtractions, and shifts in each step, making it naturally suited to reversible implementation.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Mersenne Twister algorithm was proposed by Makoto Matsumoto and Takuji Nishimura in 1997.69% similarUnverified逆运动学求解通常通过雅可比矩阵迭代完成，阻尼最小二乘法（Levenberg-Marquardt方法）通过引入正则化项规避奇异配置66% similarUnverifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, and dynamically updates the best known distance from the source node to each node by repeatedly performing relaxation operations.66% similarUnverifiedmeshoptimizer 的网格简化算法基于二次误差度量（QEM）的变体实现，QEM 由 Garland 和 Heckbert 于1997年在 SIGGRAPH 上提出64% similarUnverified凸优化是理论最完备的优化子领域，CVXPY等Python库已将其高度工程化61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1041773API
curl https://kongchang.com/api/v1/knowledge/claims/1041773MCP
get_claim(id=1041773)