Login / Signup

The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0.

Alexei MiasnikovSvetla VassilevaArmin Weiß
Published in: Theory Comput. Syst. (2019)
Keyphrases
  • experimental conditions
  • real time
  • learning algorithm
  • bayesian networks
  • computational complexity
  • hidden markov models