0
$\begingroup$

Based on the links below I wonder whether there would be some explicit EXP Complete problems which are NP Hard even when encoded in unary. Care to help me?

How to use succinct circuits to construct an EXPTIME complete problem? EXPTIME and parallel computing Weakly NP-complete problems and strongly NP-complete problems

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.