Login / Signup
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism.
David J. Rosenbaum
Published in:
ACM Trans. Comput. Theory (2020)
Keyphrases
</>
computational complexity
lower bound
special case
np hard
information systems
upper bound
search space
dynamic programming
decision making
web services
worst case
data structure
group membership
data sets
graph theory
np complete
support vector
multi agent
image segmentation
image processing
neural network