English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

From DQBF to QBF by Dependency Elimination

MPS-Authors
/persons/resource/persons44737

Karrenbauer,  Andreas       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons118120

Becker,  Ruben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Wimmer, R., Karrenbauer, A., Becker, R., Scholl, C., & Becker, B. (2017). From DQBF to QBF by Dependency Elimination. In S. Gaspers, & T. Walsh (Eds.), Theory and Applications of Satisfiability Testing -- SAT 2017 (pp. 326-343). Berlin: Springer. doi:10.1007/978-3-319-66263-3_21.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-FBAC-7
Abstract
There is no abstract available