No label defined (Q5089260)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7559456

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7559456

Statements

scholarly article

0 references

0 references

Stanislav Živný

0 references

publication date

18 July 2022

0 references

zbMATH Keywords

promise constraint satisfaction

0 references

valued constraint satisfaction

0 references

convex relaxations

0 references

polymorphisms

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the usefulness of predicates

0 references

Correlation clustering

0 references

Robustly Solvable Constraint Satisfaction Problems

0 references

Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)

0 references

Non-dichotomies in Constraint Satisfaction Complexity

0 references

The Complexity of Phylogeny Constraint Satisfaction Problems

0 references

Essential Convexity and Complexity of Semi-Algebraic Constraints

0 references

The complexity of temporal constraint satisfaction problems

0 references

Discrete Temporal Constraint Satisfaction Problems

0 references

Constraint Satisfaction Problems for Reducts of Homogeneous Graphs

0 references

Schaefer's Theorem for Graphs

0 references

0 references

0 references

An Algorithmic Blend of LPs and Ring Equations for Promise CSPs

0 references

Symmetric Polymorphisms and Efficient Decidability of Promise CSPs

0 references

Classifying the Complexity of Constraints Using Finite Algebras

0 references

Algebraic approach to promise constraint satisfaction

0 references

Approximation Resistance from Pairwise-Independent Subgroups

0 references

Approximate Constraint Satisfaction Requires Large LP Relaxations

0 references

Algorithms for the Solution of Systems of Linear Diophantine Equations

0 references

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs

0 references

Robust Satisfiability for CSPs

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

0 references

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Geometric algorithms and combinatorial optimization.

0 references

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals

0 references

Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

0 references

The Complexity of General-Valued CSPs

0 references

The Power of Linear Programming for General-Valued CSPs

0 references

Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs

0 references

Results on the propositional \(\mu\)-calculus

0 references

Algebraic Properties of Valued Constraint Satisfaction Problem

0 references

Linear programming, width-1 CSPs, and robust satisfaction

0 references

Lower Bounds on the Size of Semidefinite Programming Relaxations

0 references

0 references

The complexity of satisfiability problems

0 references

The Complexity of Finite-Valued CSPs

0 references

The Power of Sherali--Adams Relaxations for General-Valued CSPs

0 references

The Limits of SDP Relaxations for General-Valued CSPs

0 references

CSP gaps and reductions in the lasserre hierarchy

0 references

Identifiers

10.4230/LIPIcs.MFCS.2020.85

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5089260

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5089260&oldid=36831302"