$overline{SAT} in NTIME(subexp)$?
Is it possible that $overline{SAT} in NTIME(exp(n^{0.9}))$ ? Are there interesting consequences of such containment? Would it contradict the Exponential Time Hypothesis?
View Article$overline{SAT} in NTIME(subexp)$?
Is it possible that $overline{SAT} in NTIME(exp(n^{0.9}))$ ? Are there interesting consequences of such containment? Would it contradict the Exponential Time Hypothesis?
View Article#EXP-Complete problems
Let #EXP be the counting variant of NEXP, in the same way that #P is the counting variant of NP. Are there any known #EXP-complete problems? In particular, has #Succinct Sat (the natural candidate)...
View ArticleWhat do we know about $text{P}^text{NE}$
I have a $text{NEXP}$-hard problem, that can be solved by a $text{NEXP}^text{NP}$ algorithm using a single oracle call. So from Hemaspaandra we know it is in $text{P}^text{NE}$, giving us...
View ArticleWhat do we know about $text{P}^text{NE}$
I have a $text{NEXP}$-hard problem, that can be solved by a $text{NEXP}^text{NP}$ algorithm using a single oracle call. So from Hemaspaandra we know it is in $text{P}^text{NE}$, giving us...
View ArticleCorrectly formulating the padding technique [on hold]
I’m studying a proof in the book Computational Complexity: A Modern Approach. In this book there’s a proof showing that If EXP /= NEXP, then P/=NP. To proof this, they use the padding technique....
View ArticleWhat do we know about $text{P}^text{NE}$
I have a $text{NEXP}$-hard problem, that can be solved by a $text{NEXP}^text{NP}$ algorithm using a single oracle call. So from Hemaspaandra we know it is in $text{P}^text{NE}$, giving us...
View Article$overline{SAT} in NTIME(subexp)$?
Is it possible that $overline{SAT} in NTIME(exp(n^{0.9}))$ ? Are there interesting consequences of such containment? Would it contradict the Exponential Time Hypothesis?
View Article$overline{SAT} in NTIME(subexp)$?
Is it possible that $overline{SAT} in NTIME(exp(n^{0.9}))$ ? Are there interesting consequences of such containment? Would it contradict the Exponential Time Hypothesis?
View ArticleIs there a counting complexity class for succint problems?
Encoding NP-complete problems succintly often makes them NEXP-complete. I am wondering if counting the number of solutions to such a problem with a succint encoding would be any harder than solving the...
View ArticleWhat is the evidence for average case separation between EXP and NEXP?
There is significant evidence from cryptography that there exist NP-complete problems that are hard in the average case (meaning that e.g. $AvgP nsupseteq DistNP$). Namely, we have candidate one-way...
View ArticleWhen can arguments for $mathsf{NP}$ be replaced by $mathsf{NEXP}$ by...
According to papers here https://users.cs.duke.edu/~reif/temp/RandomHardProblems/NovaFandina/succinctPermanent.pdf and here http://perso.ens-lyon.fr/natacha.portier/papers/PY86.pdf questions in...
View Article