Related papers: An algorithm for dividing two complex numbers
A method to convert real number partitioned activation function into complex number one is provided. The method has 4em variations; 1 has potential to get holomorphic activation, 2 has potential to conserve complex angle, and the last 1…
An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…
In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…
Current algorithms for large-scale industrial optimization problems typically face a trade-off: they either require exponential time to reach optimal solutions, or employ problem-specific heuristics. To overcome these limitations, we…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
A quantum algorithm for the calculation of $\pi$ is proposed and implemented on the five-qubit IBM quantum computer with superconducting qubits. We find $\pi=3.157\pm0.017$. The error is due to the noise of quantum one-qubit operations and…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
The largest number factored on a quantum device reported until now was 143. That quantum computation, which used only 4 qubits at 300K, actually also factored much larger numbers such as 3599, 11663, and 56153, without the awareness of the…
We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank…
We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…
Quantum computers have been proposed to solve a number of important problems such as discovering new drugs, new catalysts for fertilizer production, breaking encryption protocols, optimizing financial portfolios, or implementing new…
No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial $F$. While computing the quotient Q=F quo G can be done in polynomial time with respect to the sparsities of F, G and Q, this is…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
We establish an effective improvement on the Liouville inequality for approximation to complex non-real algebraic numbers by quadratic complex algebraic numbers.
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…
Sentence splitting is a major simplification operator. Here we present a simple and efficient splitting algorithm based on an automatic semantic parser. After splitting, the text is amenable for further fine-tuned simplification operations.…