University of Cambridge > Talks.cam > Combinatorics Seminar > The maximal probability that k-wise independent bits are all 1

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

The maximal probability that k-wise independent bits are all 1

Add to your list(s) Download to your calendar using vCal

  • UserAriel Yadin (University of Cambridge)
  • ClockThursday 26 November 2009, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

Abstract not available

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Silicon Valley comes to the UK 2011 Machine Intelligence Lab Seminar The Politics of Economics

Other talks

Discovering regulators of insulin output with flies and human islets: implications for diabetes and pancreas cancer CANCELLED: The Impact of New Technology on Transport Planning Making Refuge: Scripture and Refugee Relief HONORARY FELLOWS PRIZE LECTURE - Towards a silent aircraft Richard Horton (The Lancet Cheif Editor): Scientific Publishing Validation & testing of novel therapeutic targets to treat osteosarcoma Existence of Lefschetz fibrations on Stein/Weinstein domains Stereodivergent Catalysis, Strategies and Tactics Towards Secondary Metabolites as enabling tools for the Study of Natural Products Biology Mathematical applications of little string theory The Rise of Augmented Intelligence in Edge Networks Hornby Model Railways
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity