Geréb, G., & Sándor, A. (2026). Effective Representation and Fast Computing With Polyarc Bounded Intervals. Acta Cybernetica, 27(3), 493. https://doi.org/10.14232/actacyb.314364
Chicago Style (17th ed.) CitationGeréb, Gábor, and András Sándor. "Effective Representation and Fast Computing With Polyarc Bounded Intervals." Acta Cybernetica 27, no. 3 (2026): 493. https://doi.org/10.14232/actacyb.314364.
MLA (9th ed.) CitationGeréb, Gábor, and András Sándor. "Effective Representation and Fast Computing With Polyarc Bounded Intervals." Acta Cybernetica, vol. 27, no. 3, 2026, p. 493, https://doi.org/10.14232/actacyb.314364.
Warning: These citations may not always be 100% accurate.