Dunne, P., Leng, P., & Nwana, G. (1995). On the complexity of Boolean functions computed by lazy oracles. IEEE transactions on computers, 44(4), 495-502. https://doi.org/10.1109/12.376165
Citace podle Chicago (17th ed.)Dunne, P.E, P.H Leng, a G.F Nwana. "On the Complexity of Boolean Functions Computed by Lazy Oracles." IEEE Transactions on Computers 44, no. 4 (1995): 495-502. https://doi.org/10.1109/12.376165.
Citace podle MLA (9th ed.)Dunne, P.E, et al. "On the Complexity of Boolean Functions Computed by Lazy Oracles." IEEE Transactions on Computers, vol. 44, no. 4, 1995, pp. 495-502, https://doi.org/10.1109/12.376165.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..