Abstract
It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.