THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM (Q5461667): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for finite rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equivalence for commutative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Objects in Certain Varieties of Inverse Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for equational theories of semi-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218196705002293 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132524082 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:10, 30 July 2024

scientific article; zbMATH DE number 2188586
Language Label Description Also known as
English
THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
scientific article; zbMATH DE number 2188586

    Statements

    THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM (English)
    0 references
    0 references
    26 July 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Term-equivalence problem
    0 references
    word problem
    0 references
    identity-checking problem
    0 references
    computational complexity
    0 references
    Perkins semigroup
    0 references
    0 references