The word and generator problems for lattices (Q1105626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Stavros S. Cosmandakis / rank
Normal rank
 
Property / author
 
Property / author: Stavros S. Cosmandakis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Structures with Hard Equivalence and Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component Subsets of the Free Lattice on n Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Word Problem for Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Modular Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Some Topological Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algebra on Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for deterministic polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5783653 / 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 decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic insolvability of the word problem in group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:04, 18 June 2024

scientific article
Language Label Description Also known as
English
The word and generator problems for lattices
scientific article

    Statements

    The word and generator problems for lattices (English)
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial-time algorithms
    0 references
    uniform word problem
    0 references
    generator problem
    0 references
    log- space complete for P
    0 references
    deterministic logarithmic space
    0 references
    free lattices
    0 references
    co- NP complete
    0 references