No label defined (Q5743434)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7053313

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

Statements

scholarly article

0 references

Vladimir Kolmogorov

0 references

Stanislav Živný

0 references

publication date

10 May 2019

0 references

full work available at URL

https://dl.acm.org/citation.cfm?id=2095177

0 references

MaRDI profile type

MaRDI publication profile

0 references

Polynomial interpolation and the Chinese remainder theorem for algebraic systems

0 references

CSP dichotomy for special triads

0 references

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

0 references

Constraint Satisfaction Problems of Bounded Width

0 references

Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited

0 references

Varieties with few subalgebras of powers

0 references

Semiring-based constraint satisfaction and optimization

0 references

A dichotomy theorem for constraint satisfaction problems on a 3-element set

0 references

Classifying the Complexity of Constraints Using Finite Algebras

0 references

Perspectives of Monge properties in optimization

0 references

Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

0 references

The complexity of soft constraint satisfaction

0 references

An optimal k-consistency algorithm

0 references

A dichotomy theorem for maximum generalized satisfiability problems.

0 references

Complexity Classifications of Boolean Constraint Satisfaction Problems

0 references

Boosting search with variable elimination in constraint optimization and constraint satisfaction problems

0 references

Network-based heuristics for constraint-satisfaction problems

0 references

The approximability of MAX CSP with fixed-value constraints

0 references

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

0 references

0 references

The complexity of homomorphism and constraint satisfaction problems seen from the other side

0 references

Constraint solving via fractional edge covers

0 references

Colouring, constraint satisfaction, and complexity

0 references

Constraints, consistency and closure

0 references

On the algebraic structure of combinatorial problems

0 references

Closure properties of constraints

0 references

Min CSP on Four Elements: Moving beyond Submodularity

0 references

The Approximability of Constraint Satisfaction Problems

0 references

Conjunctive-query containment and constraint satisfaction

0 references

A new line of attack on the dichotomy conjecture

0 references

0 references

Approximating fractional hypertree width

0 references

Tractable hypergraph properties for constraint satisfaction and conjunctive queries

0 references

Optimization, approximation, and complexity classes

0 references

0 references

How to Round Any CSP

0 references

The complexity of satisfiability problems

0 references

0 references

A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem

0 references

Extensions of the Minimum Cost Homomorphism Problem

0 references

Graphical Models, Exponential Families, and Variational Inference

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743434

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