Parallel complexity for nilpotent groups (Q5084295): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexei G. Myasnikov / rank
Normal rank
 
Property / author
 
Property / author: Alexei G. Myasnikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in Nilpotent Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random nilpotent groups, polycyclic presentations, and Diophantine problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8--12, 2001. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic problems for \(\sigma\)-power groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Matrix Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Collection using Deep Thought / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity computations for nilpotent subgroup problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homomorphisms onto finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational algorithms for deciding some problems for nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Post correspondence problem in groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative lattice problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TC^0 circuits for algorithmic problems in nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Fast Parallel GCD Algorithms of Many Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nilpotent groups / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218196722500382 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4223913419 / rank
 
Normal rank

Latest revision as of 09:34, 30 July 2024

scientific article; zbMATH DE number 7547328
Language Label Description Also known as
English
Parallel complexity for nilpotent groups
scientific article; zbMATH DE number 7547328

    Statements

    Parallel complexity for nilpotent groups (English)
    0 references
    0 references
    0 references
    24 June 2022
    0 references
    nilpotent groups
    0 references
    subgroup membership
    0 references
    \(\mathsf{TC}^0\)
    0 references
    greatest common divisors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references