Citáce podľa APA (7th ed.)

Baillot, P., Barthe, G., & Dal Lago, U. (2019). Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. Journal of automated reasoning, 63(4), 813-855. https://doi.org/10.1007/s10817-019-09530-2

Citácia podle Chicago (17th ed.)

Baillot, Patrick, Gilles Barthe, a Ugo Dal Lago. "Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs." Journal of Automated Reasoning 63, no. 4 (2019): 813-855. https://doi.org/10.1007/s10817-019-09530-2.

Citácia podľa MLA (8th ed.)

Baillot, Patrick, et al. "Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs." Journal of Automated Reasoning, vol. 63, no. 4, 2019, pp. 813-855, https://doi.org/10.1007/s10817-019-09530-2.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..