1 Introduction
 1.1 Interfaces
 1.2 Ring Declarations
 1.3 Ordering
 1.4 Arithmetic
 1.5 Set operations
 1.6 Gröbner bases
2 How to program efficiently
 2.1 Low level friendly programming
 2.2 Replace algebra by set operations
 2.3 Direct constructions of diagrams
3 Case study: Graded part of a polynomial
 3.1 Simple, algebraic solution
 3.2 Low level friendly, algebraic solution
 3.3 Highlevel with set operations
 3.4 Recursive
 3.5 Decision-diagram style recursive implementation in PolyBoRi
4 Case study: Evaluation of a polynomial
 4.1 Substitute a single variable x in a polynomial by a constant c
 4.2 Evaluate a polynomial by plugging in a constant for each variable
 4.3 General Linear Lexicographical Lead Rewriting Systems
5 Storing polynomial data in a file
6 Reinterpretation of Boolean sets as subsets of the vector space ℤ₂ⁿ
 6.1 Examples
7 Lexicographical normal form of a polynomial against a variety
8 Partial Boolean functions
9 Building your own Gröbner basis algorithm
 9.1 Adding a Generator
 9.2 Interreduction
 9.3 A minimal Buchberger algorithm
 9.4 Estimating the number of solutions