nhaliday + rand-complexity   17

Academics Make Theoretical Breakthrough in Random Number Generation | Hacker News
- interesting to see how programmers process theoretical results
- the result is that one by David Zuckerman that Henry Yuen was talking about
pseudorandomness  tcs  announcement  commentary  hn  random  bits  rand-complexity 
may 2016 by nhaliday

bundles : academetcs

related tags

aaronson  acmtariat  algorithms  analogy  announcement  approximation  average-case  big-picture  big-surf  bits  boaz-barak  books  boolean-analysis  caltech  circuits  clarity  clever-rats  coding-theory  commentary  communication-complexity  complexity  counting  course  crypto  dana-moshkovitz  encyclopedic  essay  evidence  expanders  fourier  ground-up  harvard  hi-order-bits  hierarchy  hn  init  insight  learning-theory  lecture-notes  len:long  lesswrong  liner-notes  lower-bounds  machine-learning  madhu-sudan  markov  mathtariat  mit  monte-carlo  motivation  naturality  nibble  ocw  open-problems  org:bleg  org:edu  org:junk  overflow  p:**  p:whenever  papers  pcp  philosophy  princeton  proof-systems  pseudorandomness  puzzles  q-n-a  quantum  quantum-info  questions  quixotic  rand-approx  rand-complexity  random  rationality  ratty  reflection  relativization  research  rhetoric  rigorous-crypto  s:**  salil-vadhan  sampling  space-complexity  spock  summary  synthesis  tcs  tcstariat  time-complexity  turing  UGC  unit  wigderson  yoga  👳  🤖 

Copy this bookmark:



description:


tags: