Termination of triangular polynomial loops
From MaRDI portal
Cites work
- A calculus for modular loop acceleration
- A recursive decision method for termination of linear programs
- Algebra-based synthesis of loops and their invariants (invited paper)
- Algorithms in real algebraic geometry
- An Automatic Method of Solving Discrete Programming Problems
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automatic Generation of Polynomial Loop Invariants
- Complexity of some geometric and topological problems
- Computer Aided Verification
- Computer Aided Verification
- Deciding conditional termination
- Decision procedures for real and p‐adic fields
- Definability and decision problems in arithmetic
- Fixed points, Nash equilibria, and the existential theory of the reals
- Handbuch der Lehre von der Verteilung der Primzahlen. Erster Band.
- scientific article; zbMATH DE number 3572260 (Why is no real title available?)
- scientific article; zbMATH DE number 1254301 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 7559471 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Mixed-integer quadratic programming is in NP
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Multiphase-linear ranking functions and their relation to recurrent sets
- Nearly Optimal Algorithms for Canonical Matrix Forms
- Non-termination Sets of Simple Linear Loops
- On multiphase-linear ranking functions
- On termination of integer linear loops
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the similarity of certain integer matrices with single eigenvalue over the ring of integers
- Polynomial automorphisms and the Jacobian conjecture
- Polynomial invariants by linear algebra
- Polynomial loops: beyond termination
- Polynomial maps with strongly nilpotent Jacobian matrix and the Jacobian conjecture
- Ranking functions for linear-constraint loops
- Ranking Templates for Linear Loops
- Reasoning Algebraically About P-Solvable Loops
- Symbolic decision procedure for termination of linear programs
- Symbolic termination analysis of solvable loops
- Termination of Integer Linear Programs
- Termination of linear loops over the integers
- Termination of linear programs with nonlinear constraints
- Termination of polynomial loops
- Termination of semi-algebraic loop programs
- Termination of single-path polynomial loop programs
- Termination of triangular Integer loops is decidable
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- Verification, Model Checking, and Abstract Interpretation
- What can (and can't) we do with sparse polynomials?
- Witness to non-termination of linear programs
Cited in
(3)
This page was built for publication: Termination of triangular polynomial loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987109)
