Kazuhisa Seto, Suguru Tamaki. A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. In Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012. pages 107-116, IEEE, 2012. [doi]
@inproceedings{SetoT12,
title = {A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis},
author = {Kazuhisa Seto and Suguru Tamaki},
year = {2012},
doi = {10.1109/CCC.2012.29},
url = {http://doi.ieeecomputersociety.org/10.1109/CCC.2012.29},
researchr = {https://researchr.org/publication/SetoT12},
cites = {0},
citedby = {0},
pages = {107-116},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012},
publisher = {IEEE},
isbn = {978-1-4673-1663-7},
}