Results 61 to 70 of about 263 (225)
Pseudopowers and primality proving
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for the primality testing of large integers N. In fact, assuming reasonable heuristics (which have been confirmed for numbers to 2^80) this gives a deterministic primality test in time O((lg N)^(3+o(1))), which many believe to be best possible. In the 1980s D.
Pedro Berrizbeitia +2 more
openaire +1 more source
Abstract This paper explores what is happening, for a trainee, when an ethical boundary violation occurs by the analyst with a fellow peer in training. I am approaching this through the Jungian concept of the alchemical vas as I attempt to make meaning of a catastrophic collapse of the analytic work.
Anne Marie Allen
wiley +1 more source
When Enzymes Mislead: Assessing the Value of MRCP in Suspected Choledocholithiasis
ABSTRACT Background The diagnosis of choledocholithiasis (CDL) requires balancing timely intervention against the risks of unnecessary invasive procedures. Although liver function tests (LFTs) are widely used for risk stratification, their static values and short‐term trends remain poorly defined in predicting persistent common bile duct stones.
Renato Pitesa +4 more
wiley +1 more source
Feasibility of primality in bounded arithmetic
We prove the correctness of the AKS algorithm [1] within the bounded arithmetic theory $T^{\text {count}}_2$ or, equivalently, the first-order consequences of the theory $\text {VTC}^0$ expanded by the smash function, which we denote by
Raheleh Jalali, Ondřej Ježil
doaj +1 more source
Computing Skinning Weights via Convex Duality
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Elliptic curves have a wide variety of applications in computational number theory such as elliptic curve cryptography, pairing based cryptography, primality tests, and integer factorization.
Keisuke Hakuta
doaj +1 more source
Within the conceptual framework of number theory, we consider prime numbers and the classic still unsolved problem to find a complete law of their distribution.
Gianfranco Minati
doaj +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Solving some specific tasks by Euler's and Fermat's Little theorem
Euler's and Fermat's Little theorems have a great use in number theory. Euler's theorem is currently widely used in computer science and cryptography, as one of the current encryption methods is an exponential cipher based on the knowledge of number ...
Viliam Ďuriš
doaj +1 more source
Contouring Signed Distance Fields by Approximating Gradients
Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source

