Membership testing in commutative transformation semigroups (Q1108790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for solvable permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Abelian Permutation Group Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank

Latest revision as of 18:59, 18 June 2024

scientific article
Language Label Description Also known as
English
Membership testing in commutative transformation semigroups
scientific article

    Statements

    Membership testing in commutative transformation semigroups (English)
    0 references
    0 references
    1988
    0 references
    See the review of the preliminary version of this article [Lect. Notes Comput. Sci. 267, 542-549 (1987)] in Zbl 0654.68042.
    0 references
    0 references
    NP-complete
    0 references
    commutative transformation semigroups
    0 references
    threshold
    0 references
    index
    0 references
    parallel complexity
    0 references
    0 references