other · DSpace@MIT (Massachusetts Institute of Technology) · 2005

Combinatorial Analysis

Postnikov, Alexander

Cited by 0Open access

Abstract

This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal combinatorics.

Cite this paper

APA 7

Postnikov, A. (2005). Combinatorial Analysis. DSpace@MIT (Massachusetts Institute of Technology).

MLA 9

Postnikov, Alexander. “Combinatorial Analysis.” DSpace@MIT (Massachusetts Institute of Technology), 2005.

Chicago

Postnikov, Alexander. 2005. “Combinatorial Analysis.” DSpace@MIT (Massachusetts Institute of Technology).

Harvard

Postnikov, A. (2005) ‘Combinatorial Analysis’, DSpace@MIT (Massachusetts Institute of Technology).

BibTeX

@misc{postnikov2005combinatorial,
  title = {{Combinatorial Analysis}},
  author = {Postnikov, Alexander},
  journal = {DSpace@MIT (Massachusetts Institute of Technology)},
  year = {2005}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.