A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.

MLA

Crowston, Robert, et al. “A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.” Algorithmica, vol. 64, no. 1, Sept. 2012, pp. 56–68. EBSCOhost, https://doi.org/10.1007/s00453-011-9550-1.

APA

Crowston, R., Gutin, G., Jones, M., & Yeo, A. (2012). A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica, 64(1), 56–68. https://doi.org/10.1007/s00453-011-9550-1

Chicago

Crowston, Robert, Gregory Gutin, Mark Jones, and Anders Yeo. 2012. “A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.” Algorithmica 64 (1): 56–68. doi:10.1007/s00453-011-9550-1.