Efficient solution of rational conics
From MaRDI portal
Diophantine equationefficient algorithmslattice basis reductionLegendre's equationrational conicshomogeneous quadratic polynomial with integer coefficients
[https://portal.mardi4nfdi.de/w/index.php?search=%2211G30%22&title=Special%3ASearch&profile=advanced&fulltext=1&ns120=1 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Quadratic and bilinear Diophantine equations (11D09)
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3841940 (Why is no real title available?)
- scientific article; zbMATH DE number 3977090 (Why is no real title available?)
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 51845 (Why is no real title available?)
- scientific article; zbMATH DE number 1200746 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3300651 (Why is no real title available?)
- An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
- Notes on elliptic curves. II.
- On Legendre's equation over number fields
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- On the passage from local to global in number theory
- Simultaneous representation of integers by a pair of ternary quadratic forms -- with an application to index form equations in quartic number fields
- Small solutions of the Legendre equation
Cited in
(34)- On the parametrization of solutions of quadratic equations
- Identifying the matrix ring: algorithms for quaternion algebras and quadratic forms
- Improved torsion-point attacks on SIDH variants
- Higher descents on an elliptic curve with a rational 2-torsion point
- Solving Bivariate Quadratic Congruences in Random Polynomial Time
- Factorization and root-finding for polynomials over division quaternion algebras
- Optimal affine reparametrization of rational curves
- On the solution of \(x^2+dy^2=m\)
- A Thue Equation with Quadratic Integers as Variables
- Solving quadratic equations using reduced unimodular quadratic forms
- Uniformly counting rational points on conics
- Solving conics over functions fields
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Computing with quadratic forms over number fields
- A parametric version of the Hilbert-Hurwitz theorem using hypercircles
- Computing \(L\)-series of geometrically hyperelliptic curves of genus three
- Cyclic polygons with rational sides and area
- Algorithms for quadratic forms
- Splitting full matrix algebras over algebraic number fields.
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- Computing the Cassels-Tate pairing on 3-isogeny Selmer groups via cubic norm equations
- Selected applications of LLL in number theory
- The anisotropic part of a quadratic form over a number field
- Splitting quaternion algebras over quadratic number fields
- Brauer groups of diagonal quartic surfaces
- How many rational points does a random curve have?
- Efficient computations in central simple algebras using Amitsur cohomology
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
- The anisotropic part of a quadratic form over a global function field
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- Complete and computable orbit invariants in the geometry of the affine group over the integers
- A fast algorithm for finding ``small solutions of \(F(x,y)= G(x,y)\) over imaginary quadratic fields
- scientific article; zbMATH DE number 4089637 (Why is no real title available?)
- On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\)
This page was built for publication: Efficient solution of rational conics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806396)
