Solvable Group Isomorphism Is (Almost) in NP ∩ coNP.

Vikraman Arvind Jacobo Torán

Published in: ACM Trans. Comput. Theory (2011)

Keyphrases

np complete
np hard
computational complexity
special case
decision problems
conjunctive queries
conp complete
databases
information retrieval
computer vision
case study