Tag: nexp

Found 9 results for 'nexp'.

---

1) cc.complexity-theory - Complexity of validity problem for Monadic First Order Logic?
2) cc.complexity-theory - NEXPTIME-completeness with more time for reductions
3) cc.complexity-theory - NEXP Cook-Levin
4) cc.complexity-theory - Does $\mathsf{EXP}=\mathsf{NEXP}$ imply $\mathsf{E}=\mathsf{NE}$?
5) cc.complexity-theory - Is it possible to reduce an NP language to a NEXP language with exponentially smaller input length?
6) cc.complexity-theory - On succinct $EXP$ and $NEXP$ complete problems?
7) circuit-complexity - Why should we believe that $NEXP \not \subset P/poly$
8) sat - $\overline{SAT} \in NTIME(subexp)$?
9) cc.complexity-theory - Best known algorithm for NEXP-complete problem

---