The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some algorithmic problems for finitely defined commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / 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: Constructive Aspects of Noetherian Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions in Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE ISOMORPHISM PROBLEM FOR COMMUTATIVE SEMIGROUPS / rank
 
Normal rank

Latest revision as of 18:07, 13 June 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
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    uniform word problem
    0 references
    exponential complexity
    0 references
    upper bound
    0 references
    polynomial ideal word problem
    0 references
    0 references
    0 references