SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE (Q3430310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inhomogeneous sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity at infinity for right angled Artin groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential and positive theories of equations in graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving word equations modulo partial commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Program Schemata and Maximal Parallelism I. Fundamental Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makanin's algorithm is not primitive recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of word equations with constants is in PSPACE / rank
 
Normal rank

Latest revision as of 16:22, 25 June 2024

scientific article
Language Label Description Also known as
English
SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
scientific article

    Statements