Zero-knowledge proof is a technology that allows a person who wants to prove something to prove that they know something without giving any other knowledge to others other than the fact that they know ...
https://doi.org/10.4169/amer.math.monthly.120.08.733 https://www.jstor.org/stable/10.4169/amer.math.monthly.120.08.733 Abstract After a brief discussion of the ...
Embed <iframe src="https://www.npr.org/player/embed/4254287/4254288" width="100%" height="290" frameborder="0" scrolling="no" title="NPR embedded audio player"> NPR's ...
Let G be a graph and k a natural number. A k-coloring of G is a map c that maps the vertices of G into the set {1, 2, ..., k} (whose elements are called colors) such that no two adjacent vertices are ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback