Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This problem has been widely studied in the context of graph stream processing.
New cryptographic algorithms have been created that are based on particularly hard mathematical problems. They would be virtually unbreakable, say investigators. RUB researchers have developed new ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results