Cited in
(only showing first 100 items - show all)- Rational points on the unit sphere. Approximation complexity and practical constructions
- Libra: succinct zero-knowledge proofs with optimal prover computation
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- PandA: pairings and arithmetic
- Comparative Analysis of Random Generators
- Speeding-up verification of digital signatures
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- On an asymptotic rule \(A+B/u\) for ultimate ruin probabilities under dependence by mixing
- A note on the computation of the fraction of smallest denominator in between two irreducible fractions
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- On the exponential convergence of the method of fundamental solutions
- Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem
- The complexity of class polynomial computation via floating point approximations
- On Newman polynomials which divide no Littlewood polynomial
- Computational schemes for subresultant chains
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
- scientific article; zbMATH DE number 2151189 (Why is no real title available?)
- Modular polynomials via isogeny volcanoes
- The predicates of the Apollonius diagram: algorithmic analysis and implementation
- \texttt{FIESTA 2}: parallelizeable multiloop numerical calculations
- Complex solutions of the Dean equations and non-uniqueness at all Reynolds numbers
- An adaptable and extensible geometry kernel
- Group signatures with controllable linkability for dynamic membership
- Improving the accuracy of linear programming solvers with iterative refinement
- Multiple/arbitrary precision interval computations in C-XSC
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Linnik's approximation to Goldbach's conjecture, and other problems
- Sparse polynomial division using a heap
- Efficient set intersection with simulation-based security
- A revised simplex method with integer Q-matrices
- Reconstructing rational functions with \texttt{FireFly}
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- A numerical approach to Virasoro blocks and the information paradox
- The accelerated integer GCD algorithm
- Highly accurate verified error bounds for Krylov type linear system solvers
- DUNE -- the distributed and unified numerics environment
- Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
- Parallel sparse polynomial multiplication on modern hardware architectures
- The number of Latin squares of order 11
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
- Fast computation of Goursat's infinite integral with very high accuracy
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Parallel modular exponentiation using load balancing without precomputation
- The Karatsuba integer middle product
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- The moduli space of cubic threefolds
- FORM version 4.0
- Recursion formulas for the computation of characteristic polynomials of symmetric band matrices
- scientific article; zbMATH DE number 2079355 (Why is no real title available?)
- Faster polynomial multiplication via multipoint Kronecker substitution
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- Faster repeated doublings on binary elliptic curves
- The double-base number system and its application to elliptic curve cryptography
- Algorithm 910: A portable C++ multiple-precision system for special-function calculations
- WhyMP, a formally verified arbitrary-precision integer library
- Facet defining inequalities among graph invariants: The system graphedron
- Using the method of fundamental solutions for obtaining exponentially convergent Helmholtz eigensolutions
- Improvement of lattice-based cryptography using CRT
- On the bit-complexity of sparse polynomial and series multiplication
- Effective real numbers in Mmxlib
- Linear absolute value relation analysis
- Acoustic cryptanalysis
- The many formulae for the number of Latin rectangles
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- Optimal patchings for consecutive ones matrices
- Solving very sparse rational systems of equations
- A constructive theory of continuous domains suitable for implementation
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Invariant bilinear forms on \(W\)-graph representations and linear algebra over integral domains
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
- No-neighbours recurrence schemes for space-time Green's functions on a 3D simple cubic lattice
- Refinement of a generalized Fermat's last theorem conjecture in natural vector spaces
- Enhancing data parallelism of fully homomorphic encryption
- Large order Reynolds expansions for the Navier-Stokes equations
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems
- Fast evaluation of modular functions using Newton iterations and the AGM
- New higher-order methods for the simultaneous inclusion of polynomial zeros
- Optimal estimates for the operating parameters of an information web portal
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of calculation
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Fast implementation of Curve25519 using AVX2
- Montgomery multiplication using vector instructions
- Wieferich pairs and Barker sequences
- Checking the odd Goldbach conjecture up to 10²⁰
- Improvement of error-free splitting for accurate matrix multiplication
- A search for Wilson primes
- Stochastic arithmetic in multiprecision
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Geometric data structures for computer graphics.
- The SU(3) spin model with chemical potential by series expansion techniques
- Interpolatory multipoint methods with memory for solving nonlinear equations
- Verifiable pattern matching on outsourced texts
- An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues
- Hash Functions from Sigma Protocols and Improvements to VSH
- Verifiable pattern matching on outsourced texts
- High precision numerical estimation of the largest Lyapunov exponent
- Triangulations in CGAL
- Of What Use Is Floating-Point Arithmetic in Computational Geometry?
This page was built for software: gmp
