Fulla, P., & Zivny, S. (2017). The complexity of Boolean surjective general-valued CSPs.
芝加哥风格引文Fulla, P., 与 S. Zivny. The Complexity of Boolean Surjective General-valued CSPs. 2017.
MLA引文Fulla, P., 与 S. Zivny. The Complexity of Boolean Surjective General-valued CSPs. 2017.
警告：这些引文格式不一定是100％准确.