A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10472-019-09680-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: clpfd / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SWI-Prolog / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-019-09680-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2992719104 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126629263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Logic Programming with Polynomial Constraints over Finite Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bernstein polynomial basis: a centennial retrospective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization with spline constraints: a new branch-and-bound method based on B-splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5819609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embarrassingly Parallel Search in Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision methods for solving polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Multivariate Horner Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for range computation of polynomials using the Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic manipulation in the Bernstein form made simple via convolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of constant bound functions for sparse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix methods for the tensorial Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWI-Prolog / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10472-019-09680-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:59, 17 December 2024

scientific article
Language Label Description Also known as
English
A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
scientific article

    Statements

    A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (English)
    0 references
    0 references
    0 references
    11 February 2020
    0 references
    high-degree polynomial constraints
    0 references
    polynomial constraints over finite domains
    0 references
    constraint satisfaction problems
    0 references
    0 references
    0 references

    Identifiers