- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.364 seconds)Spelling suggestions: "subject:"computational complexity. algorithms."" "subject:"computational complexity. a.lgorithms.""
| 1 |
Directional separability in two and three dimensional space.Nussbaum, Doron, Carleton University. Dissertation. Computer Science. January 1988 (has links)
Thesis (M.C.S.)--Carleton University, 1988. / Also available in electronic format on the Internet.
|
| 2 |
Techniques for analyzing the computational power of constant-depth circuits and space-bounded computationTrifonov, Vladimir Traianov, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
|
| 3 |
An exposition of the deterministic polynomial-time primality testing algorithm of Agrawal-Kayal-Saxena /Anderson, Robert Lawrence, January 2005 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2005. / Includes bibliographical references (p. 39-40).
|
Page generated in 0.3674 seconds