AbstractIn this paper, it is proved that the word problem for congruences generated by subsets of {(abc,acb)|a∈A∪{ε},b,c∈A} is NP-hard. These congruences are a generalization of Mazurkiewicz's traces
AbstractWe prove that several problems concerning congruences on algebras are complete for nondeterm...
We study constant-free versions of the inclusion problem of pattern languages and the satisfiability...
International audienceMonotone monadic strict NP (MMSNP) is a class of computational problems that i...
We investigate the class of regular-ordered word equations. In such equations, each variable occurs ...
AbstractRice's Theorem states that all nontrivial language properties of recursively enumerable sets...
AbstractWe present algebraic conditions on constraint languages Γ that ensure the hardness of the co...
We apply the algebraic approach for Constraint Satisfaction Problems (CSPs) with counting quantifier...
P versus NP is considered as one of the most important open problems in computer science. This consi...
International audienceConstraint satisfaction problems (CSPs) are combi-natorial problems with stron...
P versus NP is considered as one of the most important open problems in computer science. This consi...
Many computational problems arising in, for instance, artificial intelligence can be realized as inf...
Bulatov [Proceedings of the 35th International Colloquium on Automata, Languages and Programming (Pa...
AbstractGiven an arbitrary finite Church-Rosser Thue system S, it is shown that the question of whet...
International audienceConstraint satisfaction problems (CSPs) are combinatorial problems with strong...
A pattern (i. e., a string of variables and terminals) maps to a word, if this is obtained by unifor...
AbstractWe prove that several problems concerning congruences on algebras are complete for nondeterm...
We study constant-free versions of the inclusion problem of pattern languages and the satisfiability...
International audienceMonotone monadic strict NP (MMSNP) is a class of computational problems that i...
We investigate the class of regular-ordered word equations. In such equations, each variable occurs ...
AbstractRice's Theorem states that all nontrivial language properties of recursively enumerable sets...
AbstractWe present algebraic conditions on constraint languages Γ that ensure the hardness of the co...
We apply the algebraic approach for Constraint Satisfaction Problems (CSPs) with counting quantifier...
P versus NP is considered as one of the most important open problems in computer science. This consi...
International audienceConstraint satisfaction problems (CSPs) are combi-natorial problems with stron...
P versus NP is considered as one of the most important open problems in computer science. This consi...
Many computational problems arising in, for instance, artificial intelligence can be realized as inf...
Bulatov [Proceedings of the 35th International Colloquium on Automata, Languages and Programming (Pa...
AbstractGiven an arbitrary finite Church-Rosser Thue system S, it is shown that the question of whet...
International audienceConstraint satisfaction problems (CSPs) are combinatorial problems with strong...
A pattern (i. e., a string of variables and terminals) maps to a word, if this is obtained by unifor...
AbstractWe prove that several problems concerning congruences on algebras are complete for nondeterm...
We study constant-free versions of the inclusion problem of pattern languages and the satisfiability...
International audienceMonotone monadic strict NP (MMSNP) is a class of computational problems that i...
DOI
Add to ORKG