Abstract: In a recent work, Beierle, Brinkmann and Leander presented a recursive tree search for finding APN permutations with linear self-equivalences in small dimensions. In this paper, we describe ...
Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...
This is an introductory book on elementary particles and their interactions. It starts out with many-body Schrödinger theory and second quantization and leads, via its generalization, to relativistic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback