Login / Signup
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.
Christian Ikenmeyer
Igor Pak
Greta Panova
Published in:
CoRR (2022)
Keyphrases
</>
special case
approximation algorithms
lower level
satisfy the triangle inequality
real time
databases
neural network
machine learning
information retrieval
learning algorithm
learning environment
computational complexity
worst case
higher level