A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL (Q3839881): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Characterizations of locally testable events / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The varieties of n-testable semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Identities of a five-element \(0\)-simple semigroup / rank | |||
Normal rank | |||
Revision as of 13:38, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL |
scientific article |
Statements
A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL (English)
0 references
10 August 1998
0 references
locally testable semigroups
0 references
words
0 references
sets of generators
0 references
local testability problem
0 references
polynomial time algorithms
0 references
order of local testability
0 references
identities
0 references
