Counting -- basic and less basic
From MaRDI portal
Publication:5310596
zbMATH Open1119.05306MaRDI QIDQ5310596FDOQ5310596
Authors: Primož Potočnik
Publication date: 11 October 2007
Recommendations
Cited In (10)
- Counting cyclic binary strings
- Counting and Numbers, from Pure Mathesis to Base Conversion Algorithms
- The LEGO counting problem
- Counting colorings on varieties
- An approach to counting via equivalence relations
- Combinatorics: the mathematics that counts. II.
- Binary labeling method for combinatrorial problems
- Long-term understanding of permutations and combinations
- The counting formulas of a class of combinatorial sets with some inequality constraints
- Counting and recounting
This page was built for publication: Counting -- basic and less basic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310596)