APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Dunne, P.E, P.H Leng, and 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.

MLA (9th ed.) Citation

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.