We have a problem and we found an algorithm that appear to be 2-nexptime.I would like to find known 2-nexptime-complete problems in order to find a lower bound.I found in literature mainly two such problems:whether PCP as a solution of size less than $2^{2^n}$and the tilling problem for a square of size $2^{2^n}$However I was unable to encode these problems in mine. So I would like to know other 2-NEXPTIME-complete problems, first to have more intuition on this class, and second in the better case prove a lower bound.I do not provide here the problem on purpose in order to have a broad overview of 2-NEXPTIME.Thanks
2-NEXPTIME-complete problems
complexity classes;time complexity;complexity