Gopalan, P., Kolaitis, P. G., Maneva, E., & Papadimitriou, C. H. (2009). The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM journal on computing, 38(6), 2330-2355. https://doi.org/10.1137/07070440X
Citace podle Chicago (17th ed.)Gopalan, Parikshit, Phokion G. Kolaitis, Elitza Maneva, a Christos H. Papadimitriou. "The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies." SIAM Journal on Computing 38, no. 6 (2009): 2330-2355. https://doi.org/10.1137/07070440X.
Citace podle MLA (9th ed.)Gopalan, Parikshit, et al. "The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies." SIAM Journal on Computing, vol. 38, no. 6, 2009, pp. 2330-2355, https://doi.org/10.1137/07070440X.