Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
8 votes
0 answers
1k views

Computational complexity of multiplication in a nilpotent group?

What is the computational complexity of multiplication in a Carnot group ? Background: A Carnot group is a real nilpotent Lie group $N$ whose Lie algebra $Lie(N)$ admits a direct sum decomposition ...
Marius Buliga's user avatar