Hello Circle Members,

I am looking for someone who is well-versed in theoretical computer science and can proofread the technical parts of a manuscript about random numbers that will be published by Princeton University Press (Random Numbers: All the Best Bits).

The book is intended for general readers, but is also about zero-knowledge-proofs, entropy, randomization and derandomization of algorithms, P vs. NP, extractors and much more. The technical chapters make up about one third of the manuscript.

If you know someone who might be interested and who is conversant with papers such as:

Impagliazzo and Wigderson, “P=BPP if E requires exponential circuits…”


Goldreich, Micali and Wigderson “”Proofs that yield nothing but their validity …”

etc. etc.

I’d be very interested in hearing from you.

I am, of course, willing to pay for professional work (although Princeton’s fee is not very generous…)

Best regards from Tel Aviv,