IEEE

Diophantine Equation and the Euclidean Algorithm: Methods and Philosophy of the Algebraic Approach to Linear Multivariable Control [Lecture Notes]

Abstract: The story behind the Euclidean algorithm and its relationship to the solution of the Diophantine equation is examined in this article. The Euclidean algorithm appears in Proposition 2 in ...
IEEE

Point Cloud Segmentation Algorithm Based on Improved Euclidean Clustering

Abstract: Point cloud segmentation is a crucial technique for object recognition and localization, widely employed in various applications such as point cloud registration, 3D reconstruction, object ...
GitHub

Subarray GCD - Explanation.txt

For a subarray Ai,Ai+1...Aj where 1 ≤ i < j ≤ N to be valid: GCD(Ai,Ai+1...Aj) should be 1. You have to print the size of the largest valid subarray. If no valid subarray exists, output -1. It sounded ...
GitHub

Space-Efficient Quantum Algorithm for Elliptic-Curve Discrete Logarithms with Resource Estimation

This repository contains code for resource estimation of the space-efficient quantum modular inversion procedure used in elliptic-curve discrete logarithm settings. The project currently includes two ...