Linear loop synthesis for quadratic invariants
From MaRDI portal
Cites work
- Abstract acceleration of general linear loops
- Algebra-Based Reasoning for Loop Synthesis
- Algorithms in real algebraic geometry
- Defining integers
- Efficient solution of rational conics
- From Polynomial Invariants to Linear Loops
- How to solve a quadratic equation in integers
- How to Solve a Quadratic Equation In Rationals
- scientific article; zbMATH DE number 3117635 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- scientific article; zbMATH DE number 3397605 (Why is no real title available?)
- scientific article; zbMATH DE number 3029480 (Why is no real title available?)
- Integer solutions of systems of quadratic equations
- Number Theory
- On strongest algebraic program invariants
- On the criteria for the solvability in integers of the equation ax^2 + by^2 + cz^2 + du^2 = 0.
- On the Number of Solutions of Diophantine Equations
- On the representation of integers by quadratic forms
- Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups
- Rational Points on Elliptic Curves
- Solving quadratic equations using reduced unimodular quadratic forms
- Solving quadratic equations in dimension 5 or more without factoring
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
This page was built for publication: Linear loop synthesis for quadratic invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902681)
