Global ETD Search

11	Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation Trifonov, Vladimir Traianov 28 August 2008 (has links) Not available / text Computational complexity Algorithms
12	The effectiveness of partition testing Chan, Fun-ting., 陳訓廷. January 1998 (has links) published_or_final_version / abstract / toc / Computer Science / Doctoral / Doctor of Philosophy Partitions (Mathematics) Computational complexity.
13	Lower bounds for natural functions in restricted boolean circuits Sengupta, Rimli January 1995 (has links) No description available. Computational complexity Algebra Boolean
14	Membership testing in transformation monoids Beaudry, Martin January 1987 (has links) Given a finite set X of states, a finite set of transformations of X (generators), and another transformation f of X, we analyze the complexity of the membership problem, which consists in deciding whether f can be obtained by composition of the generators. This problem is studied for various classes (pseudovarieties) of monoids. It is shown that the complexity is NP-hard for monoids of threshold 2 or more, and NP-complete in commutative, J- and R-trivial monoids. For idempotent monoids (aperiodic of threshold one), the problem is NP-complete in the general case; subcases are analyzed, and a largest class of aperiodic monoids is identified for which the problem is in FL, as well as a largest class for which the problem is not NP-hard. / The problem which consists in characterizing an idempotent monoid is also addressed: given a set of transformations, it can be decided in NC$ sp2$ whether the monoid they generate is idempotent. Similar tests are given for three subclasses of idempotent monoids: R$ sb1$, L$ sb1$, and N$ sb3$; in all three cases, the complexity is NC$ sp1$. / A sequential upper bound is also given for each of the parallel complexities given above. Monoids. Computational complexity.
15	Contributions to computational complexity and machine learning unambiguity in log-space computations and reoptimizing multi-class classifiers / Bourke, Christopher M. January 2008 (has links) Thesis (Ph.D.)--University of Nebraska-Lincoln, 2008. / Title from title screen (site viewed Mar. 10, 2009). PDF text: vi, 77 p. : ill. ; 634 K. UMI publication number: AAT 3336828. Includes bibliographical references. Also available in microfilm and microfiche formats.
16	Efficient evolution of neural networks through complexification Stanley, Kenneth Owen, Miikkulainen, Risto, January 2004 (has links) (PDF) Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Risto Miikkulainen. Vita. Includes bibliographical references. Also available from UMI.
17	The effectiveness of partition testing / Chan, Fun-ting. January 1998 (has links) Thesis (Ph. D.)--University of Hong Kong, 1998. / Includes bibliographical references (leaf 123-128).
18	Full similarity-based page ranking Xu, Jingqian. January 2008 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2008. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 19, 2009) Includes bibliographical references. Computational complexity. Web sites
19	Algebraic-geometric methods for complexity lower bounds Dandekar, Pranav. January 2004 (has links) Thesis (M.S.)--University of Florida, 2004. / Title from title page of source document. Document formatted into pages; contains 53 pages. Includes vita. Includes bibliographical references.
20	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.

Search results