Byramji, F. (2024). Query complexity of Boolean functions on slices. Discrete mathematics, 347(6), 113954. https://doi.org/10.1016/j.disc.2024.113954
Citace podle Chicago (17th ed.)Byramji, Farzan. "Query Complexity of Boolean Functions on Slices." Discrete Mathematics 347, no. 6 (2024): 113954. https://doi.org/10.1016/j.disc.2024.113954.
Citace podle MLA (9th ed.)Byramji, Farzan. "Query Complexity of Boolean Functions on Slices." Discrete Mathematics, vol. 347, no. 6, 2024, p. 113954, https://doi.org/10.1016/j.disc.2024.113954.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..