Calculation of extended gcd by normalization

09/16/2018
by   Marc Wolf, et al.
0

We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2023

Semënov Arithmetic, Affine VASS, and String Constraints

We study extensions of Semënov arithmetic, the first-order theory of the...
research
05/04/2023

The complexity of Presburger arithmetic with power or powers

We investigate expansions of Presburger arithmetic, i.e., the theory of ...
research
03/31/2022

Decidability bounds for Presburger arithmetic extended by sine

We consider Presburger arithmetic extended by the sine function, call th...
research
09/23/2018

Neural Arithmetic Expression Calculator

This paper presents a pure neural solver for arithmetic expression calcu...
research
09/23/2018

Normalization by gluing for free λ-theories

The connection between normalization by evaluation, logical predicates a...
research
08/17/2020

Algorithm for SIS and MultiSIS problems

SIS problem has numerous applications in cryptography. Known algorithms ...
research
12/31/2020

Adaptive Quantile Computation for Brownian Bridge in Change-Point Analysis

As an example for the fast calculation of distributional parameters of G...

Please sign up or login with your details

Forgot password? Click here to reset