Pages that link to "Item:Q5056418"
From MaRDI portal
The following pages link to Algebraic Approach to Promise Constraint Satisfaction (Q5056418):
Displaying 19 items.
- Sandwiches for promise constraint satisfaction (Q1996093) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Small Promise CSPs that reduce to large CSPs (Q5043583) (← links)
- The Complexity of Promise SAT on Non-Boolean Domains (Q5066145) (← links)
- (Q5870293) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Majority-closed minions of Boolean functions (Q6183439) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Submaximal clones over a three-element set up to minor-equivalence (Q6203757) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- Conditional dichotomy of Boolean ordered promise CSPs (Q6566587) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Functors on relational structures which admit both left and right adjoints (Q6573001) (← links)
- Clonoids between modules (Q6573215) (← links)
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023 (Q6613402) (← links)
- Multisorted Boolean clones determined by binary relations up to minion homomorphisms (Q6640574) (← links)
- Near-unanimity-closed minions of Boolean functions (Q6653227) (← links)