Citace podle APA (7th ed.)

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

Citace podle Chicago (17th ed.)

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

Citace podle MLA (9th ed.)

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

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..