1 paper
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu +1
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a g…