- 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 121 to 130 of 472 (0.031 seconds)Spelling suggestions: "subject:"tet 1heory"" "subject:"tet btheory""
| 121 |
Rendezvous with madnessHrus̆ák, Michael. January 1999 (has links)
Thesis (Ph. D.)--York University, 1999. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 87-93). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pNQ43427.
|
| 122 |
Maximum likelihood estimators for circular structural modelZaeva, Maria. January 2009 (has links) (PDF)
Thesis (M.S.)--University of Alabama at Birmingham, 2009. / Title from PDF title page (viewed Jan. 21, 2010). Additional advisors: Yulia Karpeshina, Ian Knowles, Rudi Weikard. Includes bibliographical references (p. 19).
|
| 123 |
Approximation algorithms for set cover and related problemsSlavik, Petr. January 1900 (has links)
Thesis (Ph. D.)--State University of New York at Buffalo, 1998. / "April 1998." Includes bibliographical references (leaves 144-153). Also available in print.
|
| 124 |
Inwendige grensverzamelingen ...Nagel, Johannes Henderikus Gerhardus. January 1929 (has links)
Proefschrift--Utrecht. / "Stellingen" (2 L.) laid in.
|
| 125 |
Monomialization of strongly prepared morphisms to surfacesKashcheyeva, Olga S., January 2003 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaves 99-101). Also available on the Internet.
|
| 126 |
Monomialization of strongly prepared morphisms to surfaces /Kashcheyeva, Olga S., January 2003 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaves 99-101). Also available on the Internet.
|
| 127 |
THE SINGULAR POINTS OF THE FUNDAMENTAL DOMAINS FOR THE GROUPS OF BIANCHIWoodruff, William Munger, 1936- January 1967 (has links)
No description available.
|
| 128 |
A Collection of Results of Simonyi's ConjectureStyner, Dustin 17 December 2012 (has links)
Given two set systems $\mathscr{A}$ and $\mathscr{B}$ over an $n$-element set, we say that $(\mathscr{A,B})$ forms a recovering pair if the following conditions hold:
\\
$ \forall A, A' \in \mathscr{A}$ and $ \forall B, B' \in \mathscr{B}$, $A \setminus B = A' \setminus B' \Rightarrow A=A'$
\\
$ \forall A, A' \in \mathscr{A}$ and $ \forall B, B' \in \mathscr {B}$, $B \setminus A = B' \setminus A' \Rightarrow B=B'$
\\
In 1989, G\'bor Simonyi conjectured that if $(\mathscr)$ forms a recovering pair, then $|\mathscr||\mathscr|\leq 2^n$. This conjecture is the focus of this thesis.
This thesis contains a collection of proofs of special cases that together form a complete proof that the conjecture holds for all values of $n$ up to 8. Many of these special cases also verify the conjecture for certain recovering pairs when $n>8$. We also present a result describing the nature of the set of numbers over which the conjecture in fact holds. Lastly, we present a new problem in graph theory, and discuss a few cases of this problem.
|
| 129 |
On properties of completely flexible loopsRivera, Roberto Rafael 12 1900 (has links)
No description available.
|
| 130 |
Independent sets in bounded degree graphsHeckman, Christopher Carl 05 1900 (has links)
No description available.
|
Page generated in 0.0354 seconds