FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3103893175> ?p ?o ?g. }

• W3103893175 endingPage "676" @default.
• W3103893175 startingPage "657" @default.
• W3103893175 abstract "Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure (”branch and prune”) and used at every node of the search tree to narrow down the search space, so it is critical that it be fast. The procedure invokes constraint propagators until a common fixpoint is reached, but the known algorithms for this have a pseudo-polynomial worst-case time complexity: they are fast indeed when the variables have a small numerical range, but they have the well-known problem of being prohibitively slow when these ranges are large. An important question is therefore whether strongly-polynomial algorithms exist that compute the common bound consistent fixpoint of a set of constraints. This paper answers this question. In particular we show that this fixpoint computation is in fact NP-complete, even when restricted to binary linear constraints." @default.
• W3103893175 created "2020-11-23" @default.
• W3103893175 creator A5000059818 @default.
• W3103893175 creator A5026700325 @default.
• W3103893175 creator A5034897040 @default.
• W3103893175 creator A5081257309 @default.
• W3103893175 date "2011-03-28" @default.
• W3103893175 modified "2023-10-18" @default.
• W3103893175 title "The Complexity of Integer Bound Propagation" @default.
• W3103893175 cites W1488929456 @default.
• W3103893175 cites W1493367991 @default.
• W3103893175 cites W1506322549 @default.
• W3103893175 cites W1518451826 @default.
• W3103893175 cites W1521397731 @default.
• W3103893175 cites W1529082408 @default.
• W3103893175 cites W1548650523 @default.
• W3103893175 cites W1584515386 @default.
• W3103893175 cites W1587063844 @default.
• W3103893175 cites W1602856035 @default.
• W3103893175 cites W1609596465 @default.
• W3103893175 cites W1823736747 @default.
• W3103893175 cites W1885487684 @default.
• W3103893175 cites W1984540483 @default.
• W3103893175 cites W2000188963 @default.
• W3103893175 cites W2000472767 @default.
• W3103893175 cites W2002597376 @default.
• W3103893175 cites W2016639451 @default.
• W3103893175 cites W2017759899 @default.
• W3103893175 cites W2031206336 @default.
• W3103893175 cites W2042619750 @default.
• W3103893175 cites W2044413922 @default.
• W3103893175 cites W2054700680 @default.
• W3103893175 cites W2062459871 @default.
• W3103893175 cites W2073873127 @default.
• W3103893175 cites W2079809152 @default.
• W3103893175 cites W2142133061 @default.
• W3103893175 cites W2150529683 @default.
• W3103893175 cites W2152479402 @default.
• W3103893175 cites W2158007510 @default.
• W3103893175 cites W2800596119 @default.
• W3103893175 cites W47957325 @default.
• W3103893175 cites W832651592 @default.
• W3103893175 cites W2611554938 @default.
• W3103893175 doi "https://doi.org/10.1613/jair.3248" @default.
• W3103893175 hasPublicationYear "2011" @default.
• W3103893175 type Work @default.
• W3103893175 sameAs 3103893175 @default.
• W3103893175 citedByCount "6" @default.
• W3103893175 countsByYear W31038931752015 @default.
• W3103893175 countsByYear W31038931752017 @default.
• W3103893175 countsByYear W31038931752018 @default.
• W3103893175 countsByYear W31038931752019 @default.
• W3103893175 countsByYear W31038931752022 @default.
• W3103893175 countsByYear W31038931752023 @default.
• W3103893175 crossrefType "journal-article" @default.
• W3103893175 hasAuthorship W3103893175A5000059818 @default.
• W3103893175 hasAuthorship W3103893175A5026700325 @default.
• W3103893175 hasAuthorship W3103893175A5034897040 @default.
• W3103893175 hasAuthorship W3103893175A5081257309 @default.
• W3103893175 hasBestOaLocation W31038931751 @default.
• W3103893175 hasConcept C113174947 @default.
• W3103893175 hasConcept C11413529 @default.
• W3103893175 hasConcept C114614502 @default.
• W3103893175 hasConcept C125583679 @default.
• W3103893175 hasConcept C127413603 @default.
• W3103893175 hasConcept C134306372 @default.
• W3103893175 hasConcept C137105694 @default.
• W3103893175 hasConcept C154945302 @default.
• W3103893175 hasConcept C177264268 @default.
• W3103893175 hasConcept C199360897 @default.
• W3103893175 hasConcept C199622910 @default.
• W3103893175 hasConcept C207024777 @default.
• W3103893175 hasConcept C2524010 @default.
• W3103893175 hasConcept C2776036281 @default.
• W3103893175 hasConcept C311688 @default.
• W3103893175 hasConcept C33923547 @default.
• W3103893175 hasConcept C41008148 @default.
• W3103893175 hasConcept C49937458 @default.
• W3103893175 hasConcept C56086750 @default.
• W3103893175 hasConcept C61445026 @default.
• W3103893175 hasConcept C62611344 @default.
• W3103893175 hasConcept C66938386 @default.
• W3103893175 hasConcept C77553402 @default.
• W3103893175 hasConcept C90119067 @default.
• W3103893175 hasConcept C97137487 @default.
• W3103893175 hasConceptScore W3103893175C113174947 @default.
• W3103893175 hasConceptScore W3103893175C11413529 @default.
• W3103893175 hasConceptScore W3103893175C114614502 @default.
• W3103893175 hasConceptScore W3103893175C125583679 @default.
• W3103893175 hasConceptScore W3103893175C127413603 @default.
• W3103893175 hasConceptScore W3103893175C134306372 @default.
• W3103893175 hasConceptScore W3103893175C137105694 @default.
• W3103893175 hasConceptScore W3103893175C154945302 @default.
• W3103893175 hasConceptScore W3103893175C177264268 @default.
• W3103893175 hasConceptScore W3103893175C199360897 @default.
• W3103893175 hasConceptScore W3103893175C199622910 @default.
• W3103893175 hasConceptScore W3103893175C207024777 @default.
• W3103893175 hasConceptScore W3103893175C2524010 @default.

• next