Computational complexity of simultaneous elementary matching problems (Q5916324)
From MaRDI portal
scientific article; zbMATH DE number 1369968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of simultaneous elementary matching problems |
scientific article; zbMATH DE number 1369968 |
Statements
Computational complexity of simultaneous elementary matching problems (English)
0 references
17 May 2000
0 references
automated deduction
0 references
equational matching
0 references
associative-commutative matching
0 references
diophantine equations
0 references
equational theory
0 references
computational complexity
0 references
simultaneous elementary matching problems
0 references
semigroups
0 references
commutative semigroups
0 references
commutative monoids
0 references
NP-completeness
0 references
polynomial time
0 references
intractable cases
0 references
combinatorial optimization
0 references
