Reducing NEXP-complete problems to DQBF
Logic in Computer Science
2022-08-15 v1
Abstract
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 general method to reduce NEXP-complete problems to DQBF. We demonstrate its utility by presenting explicit reductions from a wide variety of NEXP-complete problems to DQBF such as (succinctly represented) 3-colorability, Hamiltonian cycle, set packing and subset-sum as well as NEXP-complete logics such as the Bernays-Sch\"onfinkel-Ramsey class, the two-variable logic and the monadic class. Our results show the vast applications of DQBF solvers which recently have gathered a lot of attention among researchers.
Keywords
Cite
@article{arxiv.2208.06014,
title = {Reducing NEXP-complete problems to DQBF},
author = {Fa-Hsun Chen and Shen-Chang Huang and Yu-Cheng Lu and Tony Tan},
journal= {arXiv preprint arXiv:2208.06014},
year = {2022}
}
Comments
To appear in the proceedings of FMCAD 2022