Eberl, M. (2017). Proving Divide and Conquer Complexities in Isabelle/HOL. Journal of automated reasoning, 58(4), 483-508. https://doi.org/10.1007/s10817-016-9378-0
Citace podle Chicago (17th ed.)Eberl, Manuel. "Proving Divide and Conquer Complexities in Isabelle/HOL." Journal of Automated Reasoning 58, no. 4 (2017): 483-508. https://doi.org/10.1007/s10817-016-9378-0.
Citace podle MLA (9th ed.)Eberl, Manuel. "Proving Divide and Conquer Complexities in Isabelle/HOL." Journal of Automated Reasoning, vol. 58, no. 4, 2017, pp. 483-508, https://doi.org/10.1007/s10817-016-9378-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..