APA (7th ed.) Citation

Sekoni, A. (2018). Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity. ProQuest Dissertations & Theses.

Chicago Style (17th ed.) Citation

Sekoni, Adewale. Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity. ProQuest Dissertations & Theses, 2018.

MLA (9th ed.) Citation

Sekoni, Adewale. Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity. ProQuest Dissertations & Theses, 2018.

Warning: These citations may not always be 100% accurate.