Termination of polynomial loops (Q2233526)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Termination of polynomial loops	scientific article

Statements

scholarly article

0 references

Termination of polynomial loops (English)

0 references

0 references

0 references

0 references

publication date

18 October 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-65474-0_5

0 references

0 references

Invariant Generation for Multi-Path Loops with Polynomial Assignments

0 references

The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates

0 references

Reasoning Algebraically About P-Solvable Loops

0 references

Ranking Templates for Linear Loops

0 references

Geometric nontermination arguments

0 references

A recursive decision method for termination of linear programs

0 references

Termination of Single-Path Polynomial Loop Programs

0 references

Termination of Semi-algebraic Loop Programs

0 references

Witness to non-termination of linear programs

0 references

0 references

Polynomial invariants by linear algebra

0 references

Synthesizing Invariants by Solving Solvable Loops

0 references

On Termination of Integer Linear Loops

0 references

Mixed-integer quadratic programming is in NP

0 references

Verification, Model Checking, and Abstract Interpretation

0 references

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

0 references

Definability and decision problems in arithmetic

0 references

What Can (and Can't) we Do with Sparse Polynomials?

0 references

Automatic Generation of Polynomial Loop Invariants

0 references

Generating all polynomial invariants in simple loops

0 references

Complexity of Some Geometric and Topological Problems

0 references

Fixed points, Nash equilibria, and the existential theory of the reals

0 references

Computer Aided Verification

0 references

Termination of linear programs with nonlinear constraints

0 references

Symbolic termination analysis of solvable loops

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-65474-0_5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2233526

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2233526&oldid=36722631"