Chang, W., Guo, M., & Luo, J. (2024). Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework. PeerJ. Computer science, 10, e2169. https://doi.org/10.7717/peerj-cs.2169
Chicago Style (17th ed.) CitationChang, Wenjing, Mengyu Guo, and Junwei Luo. "Predicting the Satisfiability of Boolean Formulas by Incorporating Gated Recurrent Unit (GRU) in the Transformer Framework." PeerJ. Computer Science 10 (2024): e2169. https://doi.org/10.7717/peerj-cs.2169.
MLA (9th ed.) CitationChang, Wenjing, et al. "Predicting the Satisfiability of Boolean Formulas by Incorporating Gated Recurrent Unit (GRU) in the Transformer Framework." PeerJ. Computer Science, vol. 10, 2024, p. e2169, https://doi.org/10.7717/peerj-cs.2169.