gmp

swMATH363MaRDI QIDQ13123FDOQ13123

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• The predicates of the Apollonius diagram: algorithmic analysis and implementation
• Computational schemes for subresultant chains
• On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
• Group signatures with controllable linkability for dynamic membership
• A revised simplex method with integer Q-matrices
• Linnik's approximation to Goldbach's conjecture, and other problems
• Sparse polynomial division using a heap
• A numerical approach to Virasoro blocks and the information paradox
• Faster polynomial multiplication via multipoint Kronecker substitution
• Improvement of lattice-based cryptography using CRT
• Fast evaluation of modular functions using Newton iterations and the AGM
• Refinement of a generalized Fermat's last theorem conjecture in natural vector spaces
• New higher-order methods for the simultaneous inclusion of polynomial zeros
• ON THE EXPONENTIAL CONVERGENCE OF THE METHOD OF FUNDAMENTAL SOLUTIONS
• Counting Points in Medium Characteristic Using Kedlaya's Algorithm
• Stochastic arithmetic in multiprecision
• Geometric data structures for computer graphics.
• Hash Functions from Sigma Protocols and Improvements to VSH
• Iteration functions re-visited
• On the improved Newton-like methods for the inclusion of polynomial zeros
• Enumerating partial Latin rectangles
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Convergence analysis of an algorithm for accurate inverse Cholesky factorization
• Relaxed algorithms for \(p\)-adic numbers
• Certifying feasibility and objective value of linear programs
• Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
• On soft predicates in subdivision motion planning
• An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)
• Polynomial root finding over local rings and application to error correcting codes
• Exponential decay of errors of a fundamental solution method applied to a reduced wave problem in the exterior region of a disc
• The many vacua of gauged extended supergravities
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• High precision series solutions of differential equations: ordinary and regular singular points of second order ODEs
• The continuing search for Wieferich primes
• Faster integer multiplication using plain vanilla FFT primes
• Fast Implementation of Curve25519 Using AVX2
• Montgomery Multiplication Using Vector Instructions
• Iterative refinement for symmetric eigenvalue decomposition
• Relaxed p-adic Hensel lifting for algebraic systems
• Computing ultra-precise eigenvalues of the Laplacian within polygons
• Relaxed Hensel lifting of triangular sets
• A dynamic F4 algorithm to compute Gröbner bases
• A characterization of chameleon hash functions and new, efficient designs
• Sign changes in sums of the Liouville function
• Watermelon uniform random generation with applications
• Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
• FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
• Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis
• The self-validated method for polynomial zeros of high efficiency
• Computational hardness of IFP and ECDLP
• Taylor's swimming sheet: analysis and improvement of the perturbation series
• On design and implementation of a generic number type for real algebraic number computations based on expression dags
• Accuracy Problems of Numerical Calculation of Fractional Order Derivatives and Integrals Applying the Riemann-Liouville/Caputo Formulas
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
• A quasi quadratic time algorithm for hyperelliptic curve point counting
• Computation of Maximal Determinants of Binary Circulant Matrices
• Optimization techniques for small matrix multiplication
• Exact solutions to linear programming problems
• The order \(p^8\) mesonic chiral Lagrangian
• 41 counterexamples to property (B) of the discrete time bomber problem
• Towards an Accurate Solution of Wireless Network Design Problems
• Computations with effective real numbers
• Missing a trick: Karatsuba variations
• The complexity of class polynomial computation via floating point approximations
• Improving the accuracy of linear programming solvers with iterative refinement
• An adaptable and extensible geometry kernel
• Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
• Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
• Highly accurate verified error bounds for Krylov type linear system solvers
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• Title not available (Why is that?)
• Recursion formulas for the computation of characteristic polynomials of symmetric band matrices
• Acoustic cryptanalysis
• A constructive theory of continuous domains suitable for implementation
• Optimal estimates for the operating parameters of an information web portal
• Checking the odd Goldbach conjecture up to 10²⁰
• Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation
• Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
• Arithmetic Software Libraries
• Title not available (Why is that?)
• Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
• An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues
• Verifiable pattern matching on outsourced texts
• Stabilizing Floating-Point Programs Using Provenance Analysis
• Computer-assisted proof of loss of ergodicity by symmetry breaking in expanding coupled maps
• Perturbating RSA Public Keys: An Improved Attack
• Title not available (Why is that?)
• A highly efficient root-solver of very fast convergence
• Using the Method of Fundamental Solutions for Obtaining Exponentially Convergent Helmholtz Eigensolutions
• A multimodular algorithm for computing Bernoulli numbers
• Enhancing Data Parallelism of Fully Homomorphic Encryption
• Private-key fully homomorphic encryption for private classification
• A verified ODE solver and the Lorenz attractor
• A computational status update for exact rational mixed integer programming
• A finite-step construction of totally nonnegative matrices with specified eigenvalues
• A cache-friendly truncated FFT
• An efficient algorithm for attribute-based subsequence matching
• The verified CakeML compiler backend
• Lower bounds for Z-numbers

This page was built for software: gmp