• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 732
  • 269
  • 129
  • 52
  • 19
  • 14
  • 11
  • 6
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 2
  • Tagged with
  • 1471
  • 667
  • 256
  • 242
  • 241
  • 240
  • 186
  • 181
  • 174
  • 167
  • 158
  • 150
  • 142
  • 140
  • 107
  • 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.
111

Invariants of groups acting on polynomial rings.

January 1986 (has links)
by Chan Suk Ha Iris. / Bibliography: leaves 84-88 / Thesis (M.Ph.)--Chinese University of Hong Kong
112

An Erlanger program for combinatorial geometries.

Kung, Joseph Pee Sin January 1978 (has links)
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Vita. / Bibliography: leaves 132-137. / Ph.D.
113

Combinatorial Proofs of Congruences

Rouse, Jeremy 01 May 2003 (has links)
Combinatorial techniques can frequently provide satisfying “explanations” of various mathematical phenomena. In this thesis, we seek to explain a number of well known number theoretic congruences using combinatorial methods. Many of the results we prove involve the Fibonacci sequence and its generalizations.
114

Moore - Greig designs - a new combinatorial structure /

Collins, Jarred T. January 2005 (has links)
Thesis (Ph. D.)--University of Rhode Island, 2005. / Typescript. Includes bibliographical references (leaves 73-74).
115

Experimental methods applied to the computation of integer sequences

Rowland, Eric Samuel, January 2009 (has links)
Thesis (Ph. D.)--Rutgers University, 2009. / "Graduate Program in Mathematics." Includes bibliographical references (p. 57-59).
116

Some stochastic properties of random classical and Carlitz compositions /

Kheyfets, Boris Leonid. January 2004 (has links)
Thesis (Ph. D.)--Drexel University, 2004. / Includes abstract and vita.
117

Algorithms and heuristics for combinatorial optimization in phylogeny

Ganapathysaravanabavan, Ganeshkumar 28 August 2008 (has links)
Not available / text
118

Restricted Universes of Partizan Misere Games

Milley, Rebecca 25 March 2013 (has links)
This thesis considers three restricted universes of partizan combinatorial games and finds new results for misere play using the recently-introduced theory of indistinguishability quotients. The universes are defined by imposing three different conditions on game play: alternating, dicot (all-small), and dead-ending. General results are proved for each main universe, which in turn facilitate detailed analysis of specific subuniverses. In this way, misere monoids are constructed for alternating ends, for pairs of day-2 dicots, and for normal-play numbers, as well as for sets of positions that occur in variations of nim, hackenbush, and kayles, which fall into the alternating, dicot, and dead-ending universes, respectively. Special attention is given to equivalency to zero in misere play. With a new sufficiency condition for the invertibility of games in a restricted universe, the thesis succeeds in demonstrating the invertibility (modulo specific universes) of all alternating ends, all but previous-win alternating non-ends, all but one day-2 dicot, over one thousand day-3 dicots, hackenbush ‘sprigs’, dead ends, normal-play numbers, and partizan kayles positions. Connections are drawn between the three universes, including the recurrence of monoids isomorphic to the group of integers under addition, and the similarities of universe-specific outcome determinants. Among the suggestions for future research is the further investigation of a natural and promising subset of dead-ending games called placement games.
119

Shortest paths and multicommodity network flows

Wang, I-Lin 05 1900 (has links)
No description available.
120

O(n) planar network shortest path algorithm

Hong, Chyi-Fu 05 1900 (has links)
No description available.

Page generated in 0.0233 seconds