Q5089260 (Q5089260): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the usefulness of predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustly Solvable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Phylogeny Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential Convexity and Complexity of Semi-Algebraic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Temporal Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems for Reducts of Homogeneous Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schaefer's Theorem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Blend of LPs and Ring Equations for Promise CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Polymorphisms and Efficient Decidability of Promise CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic approach to promise constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Resistance from Pairwise-Independent Subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Solution of Systems of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Satisfiability for CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction and semilinear expansions of addition over the rationals and the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Linear Programming for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Properties of Valued Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, width-1 CSPs, and robust satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Sherali--Adams Relaxations for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Limits of SDP Relaxations for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank

Latest revision as of 15:47, 29 July 2024

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

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    promise constraint satisfaction
    0 references
    valued constraint satisfaction
    0 references
    convex relaxations
    0 references
    polymorphisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers