AbstractSuppose the polynomials P1…, Pk∈ℤ[X1,…,Xn, U], h∈ℤ[X1,…,Xn] have degrees deg(Pi), deg(h)<d and the absolute value of any coefficient of Pi or h is less or equal to 2M for all 1≤i≤k. An algorithm is described which recognizes the consistency in ℝn of the system of inequalities P1(X1,...Xn, eh(X1,…,Xn))≥0,…,Pk(X1,…,Xn, eh(X1,…,Xn)≥0 within time polynomial in M(nkd)n4
We study the algorithmic complexity of the subproblems of simultaneous divisibility of values of lin...
Contents Chapter I. Introduction 1 1. Systems of polynomials with Integer coefficients 1 2. Global c...
A system of linear inhomogeneous inequalities is examined. An algorithm is presented for isolating a...
AbstractSuppose the polynomials P1…, Pk∈ℤ[X1,…,Xn, U], h∈ℤ[X1,…,Xn] have degrees deg(Pi), deg(h)<d a...
In recent years a number of algorithms have been designed for the "inverse" computational ...
International audienceWe present a probabilistic Las Vegas algorithm for solving sufficiently generi...
Let P:=(P1,…,Ps) be a given family of n-variate polynomials with integer coefficients and suppose th...
Two series of number-theoretic problems concerning modulo m dis-comparisons with explicitly pointed ...
La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour ...
International audienceThis paper gives an O(nlog n) bound-consistency filtering algorithm for the co...
Three series of number-theoretic problems concerning systems of modulo m comparisons and systems of...
A new method to solve the solution set of polynomial inequalities was conducted. When −1 −2 >0 ℎ 1,2...
This paper gives an O(n log n) bound-consistency filtering algorithm for the conjunction alldifferen...
(eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be ...
AbstractWe present an iterative numerical method for solving two classical stability problems for a ...
We study the algorithmic complexity of the subproblems of simultaneous divisibility of values of lin...
Contents Chapter I. Introduction 1 1. Systems of polynomials with Integer coefficients 1 2. Global c...
A system of linear inhomogeneous inequalities is examined. An algorithm is presented for isolating a...
AbstractSuppose the polynomials P1…, Pk∈ℤ[X1,…,Xn, U], h∈ℤ[X1,…,Xn] have degrees deg(Pi), deg(h)<d a...
In recent years a number of algorithms have been designed for the "inverse" computational ...
International audienceWe present a probabilistic Las Vegas algorithm for solving sufficiently generi...
Let P:=(P1,…,Ps) be a given family of n-variate polynomials with integer coefficients and suppose th...
Two series of number-theoretic problems concerning modulo m dis-comparisons with explicitly pointed ...
La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour ...
International audienceThis paper gives an O(nlog n) bound-consistency filtering algorithm for the co...
Three series of number-theoretic problems concerning systems of modulo m comparisons and systems of...
A new method to solve the solution set of polynomial inequalities was conducted. When −1 −2 >0 ℎ 1,2...
This paper gives an O(n log n) bound-consistency filtering algorithm for the conjunction alldifferen...
(eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be ...
AbstractWe present an iterative numerical method for solving two classical stability problems for a ...
We study the algorithmic complexity of the subproblems of simultaneous divisibility of values of lin...
Contents Chapter I. Introduction 1 1. Systems of polynomials with Integer coefficients 1 2. Global c...
A system of linear inhomogeneous inequalities is examined. An algorithm is presented for isolating a...
DOI
Add to ORKG