NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 98
  • 40
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 179
  • 179
  • 55
  • 45
  • 39
  • 37
  • 25
  • 23
  • 23
  • 20
  • 19
  • 16
  • 16
  • 15
  • 15
  • 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 51 to 60 of 179 (0.068 seconds)

Spelling suggestions: "subject:"combinatorial aanalysis "" "subject:"combinatorial 2analysis ""

51

Combinatorial Proofs Using Complex Weights

Chen, Bo 30 May 2010 (has links)
In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.
Combinatorial analysis
Combinatrics
Mathematics
Physical Sciences and Mathematics
52

Second graders' solution strategies and understanding of a combination problem /

Hessing, Tiffany Marie, January 2006 (has links) (PDF)
Thesis (M.A.)--Brigham Young University. Dept of Mathematics Education, 2006. / Includes bibliographical references (p. 65-66).
53

Combinatorics of degeneracy loci /

Buch, Anders Skovsted January 1999 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, August 1999. / Includes bibliographical references. Also available on the Internet.
54

Additive stucture, rich lines, and exponential set-expansion

Borenstein, Evan. January 2009 (has links)
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009. / Committee Chair: Croot, Ernie; Committee Member: Costello, Kevin; Committee Member: Lyall, Neil; Committee Member: Tetali, Prasad; Committee Member: Yu, XingXing. Part of the SMARTech Electronic Thesis and Dissertation Collection.
55

Lower bound methods for multiparty communication complexity

Ford, Jeffrey Stephen 28 August 2008 (has links)
Not available / text
Combinatorial analysis
Tensor products
Computational complexity
56

Combinatorial mechanics

Amiouny, Samir V. 08 1900 (has links)
No description available.
Stability
Combinatorial analysis
Mechanics
Structural design
57

The maximum clique problem - on finding an upper bound with application to protein structure alignment

Baamann, Katharina 08 1900 (has links)
No description available.
Combinatorial analysis
Graphic methods
Proteins Structure
58

The structure of the solution space and its relation to execution time of evolutionary algorithms with applications

Ghannadian, Farzad 12 1900 (has links)
No description available.
Combinatorial analysis
Combinatorial mathematics
Markov processes
59

On the likely number of stable marriages

Lennon, Craig, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 123-124).
60

Designs on cubic multigraphs.

Carter, Janine Elizabeth. Rosa, A. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1989. / Source: Dissertation Abstracts International, Volume: 62-13, Section: A, page: 0000.

Page generated in 0.0742 seconds