APA (7th ed.) Citation

Seto, K., & Tamaki, S. (2013). A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Computational complexity, 22(2), 245-274. https://doi.org/10.1007/s00037-013-0067-7

Chicago Style (17th ed.) Citation

Seto, Kazuhisa, and Suguru Tamaki. "A Satisfiability Algorithm and Average-case Hardness for Formulas over the Full Binary Basis." Computational Complexity 22, no. 2 (2013): 245-274. https://doi.org/10.1007/s00037-013-0067-7.

MLA (9th ed.) Citation

Seto, Kazuhisa, and Suguru Tamaki. "A Satisfiability Algorithm and Average-case Hardness for Formulas over the Full Binary Basis." Computational Complexity, vol. 22, no. 2, 2013, pp. 245-274, https://doi.org/10.1007/s00037-013-0067-7.