On the integer solutions of quadratic equations
From MaRDI portal
Recommendations
- On small solutions of the general nonsingular quadratic Diophantine equation in five or more unknowns
- Solving quadratic equations using reduced unimodular quadratic forms
- A mesh algorithm for principal quadratic forms
- Effective Hasse principle for the intersection of two quadrics
- Algorithms for integral solutions of a class of Diophantine equations
Cited in
(13)- A remark on maximal integer solutions
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- Diophantine equations with three monomials
- Solving quadratic equations in dimension 5 or more without factoring
- What can and cannot be done with Diophantine problems
- On integral solutions of quadratic inequalities
- Effective bounds for Vinberg's algorithm for arithmetic hyperbolic lattices
- Costs and rewards in priced timed automata
- Effective Hasse principle for the intersection of two quadrics
- Costs and rewards in priced timed automata
- scientific article; zbMATH DE number 3858300 (Why is no real title available?)
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- Strong approximation for certain quadric fibrations with compact fibers
This page was built for publication: On the integer solutions of quadratic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810834)