Representations of the symmetric group are decomposable in polynomial time.

Published in: CoRR (2022)

Keyphrases

computational complexity
satisfy the triangle inequality
neural network
genetic algorithm
special case
higher level
machine learning
artificial intelligence
search engine
bayesian networks
learning environment
worst case
np complete
bounded treewidth