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 ...
As part of the FDA's rolling review of the biologics license application, Vertex expects to submit the first module to the regulator for potential accelerated approval before the end of 2025, and said ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback