FRINK Linked Data Fragments server

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

• W2884037933 endingPage "455" @default.
• W2884037933 startingPage "436" @default.
• W2884037933 abstract "Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well known problems can be cast as promise CSPs including approximate graph and hypergraph coloring, discrepancy minimization, and interesting variants of satisfiability. Similar to CSPs, the tractability of promise CSPs can be tied to the structure of associated operations on the solution space called (weak) polymorphisms. However, compared to CSPs whose polymorphisms are well-structured algebraic objects called clones, polymorphisms in the promise world are much less constrained — essentially any infinite family of functions obeying mild conditions can arise as polymorphisms. Under the thesis that non-trivial polymorphisms govern tractability, promise CSPs therefore provide a fertile ground for the discovery of novel algorithms.In previous work, we classified all tractable cases of Boolean promise CSPs when the constraint predicates are symmetric. The algorithms were governed by three kinds of polymorphism families: (i) parity functions, (ii) majority functions, or (iii) a non-symmetric (albeit block-symmetric) family we called alternating threshold. In this work, we provide a vast generalization of these algorithmic results. Specifically, we show that promise CSPs that admit a family of “regional-periodic” polymorphisms are solvable in polynomial time, assuming that determining which region a point is in can be computed in polynomial time. Such polymorphisms are quite general and are obtained by gluing together several functions that are periodic in the Hamming weights in different blocks of the input. For example, we can have functions that equal parity for relative Hamming weights up to 1/2, and Majority (so identically 1) for weights above 1/2.Our algorithm is based on a novel combination of linear programming and solving linear systems over rings. We also abstract a framework based on reducing a promise CSP to a CSP over an infinite domain, solving it there (via the said combination of LPs and ring equations), and then rounding the solution to an assignment for the promise CSP instance. The rounding step is intimately tied to the family of polymorphisms, and clarifies the connection between polymorphisms and algorithms in this context. As a key ingredient, we introduce the technique of finding a solution to a linear program with integer coefficients that lies in a different ring (such as ℤ) to bypass ad-hoc adjustments for lying on a rounding boundary." @default.
• W2884037933 created "2018-08-03" @default.
• W2884037933 creator A5028220417 @default.
• W2884037933 creator A5068388812 @default.
• W2884037933 date "2019-01-01" @default.
• W2884037933 modified "2023-09-24" @default.
• W2884037933 title "An Algorithmic Blend of LPs and Ring Equations for Promise CSPs" @default.
• W2884037933 cites W1492972816 @default.
• W2884037933 cites W1506951734 @default.
• W2884037933 cites W1969999211 @default.
• W2884037933 cites W1997649256 @default.
• W2884037933 cites W1999692791 @default.
• W2884037933 cites W2003464009 @default.
• W2884037933 cites W2019944649 @default.
• W2884037933 cites W2024997126 @default.
• W2884037933 cites W2026753685 @default.
• W2884037933 cites W2032980094 @default.
• W2884037933 cites W2063191044 @default.
• W2884037933 cites W2087038607 @default.
• W2884037933 cites W2104254886 @default.
• W2884037933 cites W2110871651 @default.
• W2884037933 cites W2150339067 @default.
• W2884037933 cites W2594596354 @default.
• W2884037933 cites W2605041732 @default.
• W2884037933 cites W2625656873 @default.
• W2884037933 cites W2776885602 @default.
• W2884037933 cites W3082146116 @default.
• W2884037933 cites W599692955 @default.
• W2884037933 doi "https://doi.org/10.1137/1.9781611975482.28" @default.
• W2884037933 hasPublicationYear "2019" @default.
• W2884037933 type Work @default.
• W2884037933 sameAs 2884037933 @default.
• W2884037933 citedByCount "8" @default.
• W2884037933 countsByYear W28840379332019 @default.
• W2884037933 countsByYear W28840379332021 @default.
• W2884037933 countsByYear W28840379332023 @default.
• W2884037933 crossrefType "book-chapter" @default.
• W2884037933 hasAuthorship W2884037933A5028220417 @default.
• W2884037933 hasAuthorship W2884037933A5068388812 @default.
• W2884037933 hasBestOaLocation W28840379331 @default.
• W2884037933 hasConcept C105795698 @default.
• W2884037933 hasConcept C114614502 @default.
• W2884037933 hasConcept C118615104 @default.
• W2884037933 hasConcept C132180345 @default.
• W2884037933 hasConcept C137105694 @default.
• W2884037933 hasConcept C168773769 @default.
• W2884037933 hasConcept C199622910 @default.
• W2884037933 hasConcept C2781221856 @default.
• W2884037933 hasConcept C33923547 @default.
• W2884037933 hasConcept C41008148 @default.
• W2884037933 hasConcept C49937458 @default.
• W2884037933 hasConceptScore W2884037933C105795698 @default.
• W2884037933 hasConceptScore W2884037933C114614502 @default.
• W2884037933 hasConceptScore W2884037933C118615104 @default.
• W2884037933 hasConceptScore W2884037933C132180345 @default.
• W2884037933 hasConceptScore W2884037933C137105694 @default.
• W2884037933 hasConceptScore W2884037933C168773769 @default.
• W2884037933 hasConceptScore W2884037933C199622910 @default.
• W2884037933 hasConceptScore W2884037933C2781221856 @default.
• W2884037933 hasConceptScore W2884037933C33923547 @default.
• W2884037933 hasConceptScore W2884037933C41008148 @default.
• W2884037933 hasConceptScore W2884037933C49937458 @default.
• W2884037933 hasLocation W28840379331 @default.
• W2884037933 hasLocation W28840379332 @default.
• W2884037933 hasOpenAccess W2884037933 @default.
• W2884037933 hasPrimaryLocation W28840379331 @default.
• W2884037933 hasRelatedWork W1818081266 @default.
• W2884037933 hasRelatedWork W1898488645 @default.
• W2884037933 hasRelatedWork W2011384810 @default.
• W2884037933 hasRelatedWork W2085440561 @default.
• W2884037933 hasRelatedWork W2187257131 @default.
• W2884037933 hasRelatedWork W2963777621 @default.
• W2884037933 hasRelatedWork W3092167057 @default.
• W2884037933 hasRelatedWork W3102682405 @default.
• W2884037933 hasRelatedWork W3104448694 @default.
• W2884037933 hasRelatedWork W3139029615 @default.
• W2884037933 isParatext "false" @default.
• W2884037933 isRetracted "false" @default.
• W2884037933 magId "2884037933" @default.
• W2884037933 workType "book-chapter" @default.