General Combinatorial Principles and Methods
- Combinatorial principles
- Trial and error, brute force search, bogosort, British Museum algorithm
- Pigeonhole principle
- Method of distinguished element
- Mathematical induction
- Recurrence relation, telescoping series
- Generating functions as an application of formal power series
- Schrödinger method
- exponential generating function
- Stanley's reciprocity theorem
- Binomial coefficients and their properties
- Combinatorial proof
- Double counting (proof technique)
- Bijective proof
- Inclusion-exclusion principle
- Möbius inversion formula
- Parity, even and odd permutations
- Combinatorial Nullstellensatz
- Incidence algebra
- Greedy algorithm
- Divide and conquer algorithm
- Akra-Bazzi method
- Dynamic programming
- Branch and bound
- Birthday attack, birthday paradox
- Floyd's cycle-finding algorithm
- Reduction to linear algebra
- Sparsity
- Weight function
- Minimax algorithm
- Alpha-beta pruning
- Probabilistic method
- Sieve methods
- Analytic combinatorics
- Symbolic combinatorics
- Combinatorial class
- Exponential formula
- Twelvefold way
- MacMahon Master theorem
Read more about this topic: Outline Of Combinatorics
Famous quotes containing the words general, principles and/or methods:
“The General Strike has taught the working class more in four days than years of talking could have done.”
—A.J. (Arthur James)
“Though the ancients were ignorant of the principles of Christianity there were in them the germs of its spirit.”
—Herman Melville (1819–1891)
“A writer who writes, “I am alone” ... can be considered rather comical. It is comical for a man to recognize his solitude by addressing a reader and by using methods that prevent the individual from being alone. The word alone is just as general as the word bread. To pronounce it is to summon to oneself the presence of everything the word excludes.”
—Maurice Blanchot (b. 1907)
Related Phrases
Related Words