The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0001-8708(82)90048-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013504313 / rank | |||
Normal rank | |||
Revision as of 01:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the word problems for commutative semigroups and polynomial ideals |
scientific article |
Statements
The complexity of the word problems for commutative semigroups and polynomial ideals (English)
0 references
1982
0 references
uniform word problem
0 references
exponential complexity
0 references
upper bound
0 references
polynomial ideal word problem
0 references
