Existence of objects such as affine planes and resolvable block designs can be recast as algorithmic reductions involving the pigeonhole principle, allowing computability techniques to prove new combinatorial results.
Bibliography on Weihrauch complexity, website: http://cca-net.de/publications/weibib.php
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite combinatorics and computability theory
Existence of objects such as affine planes and resolvable block designs can be recast as algorithmic reductions involving the pigeonhole principle, allowing computability techniques to prove new combinatorial results.