Functions find k-combinations and k-permutations of your array of n elements using multithreading(C(n, k); A(n, k)).

A132581 posets.

Custom implementation of some algorithms in C++

UVa Solved Problems

Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s

hackerrank graph theory problem which merges disjoint sets for path compression.

Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.

Range Combinatorics -- Range-v3 views for permutations and combinations

Grad school, Software Engineering, Automated Combinatorial Testing for Software project. A set of parameters is identified that define the space of possible test scenarios. Then, combinatorial designs are used to create a test plan that “covers” all n-way combinations of the test parameters.

A collection of Codes written by Sajjad Hossain Talukder which implements basic Data_Structure and Algorithms .

Template metaprogramming library originally spun off from CppOrderBook project.

Tsinghua project - Generate all permutations

My solutions to selected Project Euler questions.

Discrete Structures & Analysis.

Laboratory problems and solutions for the ITMO course "Discrete Mathematics".

All problems solutions From Codeforces.com Website

Computing the number of integer partitions with upper bounds in parallel

Computing All Distinct Squares

Grad school, Theory of Combinatorics, Power Set implementation. Given a set 'S', the power set of 'S' is the set of all subsets of 'S'. Power sets are larger than the sets associated with them.