pseudorandomness   23

254A, Supplement 4: Probabilistic models and heuristics for the primes (optional) | What's new
among others, the CramΓ©r model for the primes (basically kinda looks like primality is independently distributed w/ Pr[n is prime] = 1/log n)
gowers  mathtariat  lecture-notes  exposition  math  math.NT  probability  heuristic  models  cartoons  nibble  org:bleg  pseudorandomness  borel-cantelli  concentration-of-measure  multiplicative 
february 2017 by nhaliday
6.896: Essential Coding Theory
- probabilistic method and Chernoff bound for Shannon coding
- probabilistic method for asymptotically good Hamming codes (Gilbert coding)
- sparsity used for LDPC codes
mit  course  yoga  tcs  complexity  coding-theory  math.AG  fields  polynomials  pigeonhole-markov  linear-algebra  probabilistic-method  lecture-notes  bits  sparsity  concentration-of-measure  linear-programming  linearity  expanders  hamming  pseudorandomness  crypto  rigorous-crypto  communication-complexity  no-go  madhu-sudan  shannon  unit  p:**  quixotic 
february 2017 by nhaliday

related tags

aaronson  algebra  algebraic-complexity  announcement  approximation  arrows  bare-hands  big-surf  bits  boaz-barak  bonferroni  boolean-analysis  borel-cantelli  caltech  cartoons  circuits  classification  coding-theory  commentary  communication-complexity  commutativity  complexity  concentration-of-measure  concept  counting  course  crypto  dana-moshkovitz  dependence-independence  design  entropy-like  estimate  evidence  expanders  expectancy  exposition  fields  fourier_analysis  games  gowers  ground-up  hamming  hard-core  harvard  heuristic  hierarchy  hmm  hn  iidness  information-theory  init  invariance_principles  learning-theory  lecture-notes  lectures  levers  linear-algebra  linear-programming  linearity  liner-notes  list  lower-bounds  luca-trevisan  machine-learning  madhu-sudan  magnitude  math.nt  math  mathtariat  mit  mixing  models  motivation  multiplicative  naturality  news  nibble  no-go  ocw  open-problems  org:bleg  org:edu  org:junk  org:mag  org:sci  overflow  p:**  papers  pcp  pigeonhole-markov  polynomials  popsci  princeton  probabilistic-method  probability  programming  proof-systems  proofs  puzzles  q-n-a  quantum-info  quantum  questions  quixotic  rand-approx  rand-complexity  random  reflection  relativization  research  rigorous-crypto  running-course  salil-vadhan  shannon  signal-noise  space-complexity  sparsity  spectral  stories  structure  summary  synthesis  tcs  tcstariat  tidbits  time-complexity  to_view  topics  turing  unit  valiant  videos  volo-avolo  wigderson  yoga  πŸ‘³ 

Copy this bookmark: