The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups (Q5055940): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some algorithmic problems for finitely defined commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Polynomial Ideals and Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible orders and linear forms / rank
 
Normal rank

Revision as of 03:02, 31 July 2024

scientific article; zbMATH DE number 7631377
Language Label Description Also known as
English
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
scientific article; zbMATH DE number 7631377

    Statements

    Identifiers