2017
DOI: 10.1007/s10472-017-9544-z
|View full text |Cite
|
Sign up to set email alerts
|

Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…A related method that is expected to be less expensive in terms of the inherent computational cost can be derived from a recent result [19] that originates from the research on the satisfaction of polynomial constraints over finite domains [30]. Actually, the mentioned result can be used to compute lower and upper bounds for a polynomial function over a box without using Bernstein coefficients.…”
Section: The Post U Algorithmmentioning
confidence: 99%
“…A related method that is expected to be less expensive in terms of the inherent computational cost can be derived from a recent result [19] that originates from the research on the satisfaction of polynomial constraints over finite domains [30]. Actually, the mentioned result can be used to compute lower and upper bounds for a polynomial function over a box without using Bernstein coefficients.…”
Section: The Post U Algorithmmentioning
confidence: 99%