The complexity of resilience problems via valued constraint satisfaction
From MaRDI portal
Cites work
- A Characterisation of First-Order Constraint Satisfaction Problems
- A complexity dichotomy in spatial reasoning via Ramsey theory
- A dichotomy for first-order reducts of unary structures
- A dichotomy theorem for nonuniform CSPs
- A Galois connection for weighted (relational) clones of infinite size
- A new approach to the maximum-flow problem
- A proof of the CSP dichotomy conjecture
- A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
- Algebraic properties of valued constraint satisfaction problem
- An Algebraic Characterisation of Complexity for Valued Constraint
- An algebraic theory of complexity for discrete optimization.
- An introduction to measure theory
- Complexity of infinite-domain constraint satisfaction
- Computer Science Logic
- Cores of Countably Categorical Structures
- CORES OVER RAMSEY STRUCTURES
- Correlation clustering
- Directed flow-augmentation
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Evaluation and enumeration problems for regular path queries
- Homomorphism and embedding universal structures for restricted classes
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Infinite dimensional analysis. A hitchhiker's guide.
- Measure theory. Vol. I and II
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Parameterized algorithms
- Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
- Probability theory
- PROJECTIVE CLONE HOMOMORPHISMS
- Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
- Solving hard cut problems via flow-augmentation
- Testing the Complexity of a Valued CSP Language
- The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
- The complexity of equality constraint languages
- The complexity of finite-valued CSPs
- The complexity of general-valued CSPs
- The complexity of resilience problems via valued constraint satisfaction problems
- The complexity of valued CSPs
- The power of linear programming for general-valued CSPs
- The wonderland of reflections
- Universal graphs with forbidden subgraphs and algebraic closure
- Universial structures with forbidden homomorphisms
This page was built for publication: The complexity of resilience problems via valued constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325536)
