How “random” is Ryanair's seating allocation?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Do Random Allocation (Randomization)

PURPOSE To explain the concept and procedure of random allocation as used in a randomized controlled study. METHODS We explain the general concept of random allocation and demonstrate how to perform the procedure easily and how to report it in a paper.

متن کامل

Phase transitions on random lattices: how random is topological disorder?

We study the effects of topological (connectivity) disorder on phase transitions. We identify a broad class of random lattices whose disorder fluctuations decay much faster with increasing length scale than those of generic random systems, yielding a wandering exponent of ω=(d-1)/(2d) in d dimensions. The stability of clean critical points is thus governed by the criterion (d+1)ν>2 rather than ...

متن کامل

How Risky Is the Random-Oracle Model?

RSA-FDH and many other schemes secure in the RandomOracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instantiations proposed in the literature for such cases are weaker than a random oracle, including the proposals by Bellare and Rogaway from 1993 and 1996, and the ones implicit in IEEE P1363 and PKCS standards: for instance, ...

متن کامل

How strong is Nisanʼs pseudo-random generator?

We study the resilience of the classical pseudo-random generator (PRG) of Nisan [Nis92] against space-bounded machines that make multiple passes over the input. Our motivation comes from the derandomization of BPNC. Observe that if for every log-space machine that reads its input n times there is a PRG fooling this machine, then in particular we fool NC circuits. Nisan’s PRG is known to fool lo...

متن کامل

How Random Is Quantum Randomness ? ( Extended

Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness—recently proved to be theoretically incomputable—and some well-known computable sources of pseudo-randomness. Incomputability is a necessary, but not sufficient “symptom” of “true randomness.” We base our experimental approach on algorithmic information theory which provides characterizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Significance

سال: 2017

ISSN: 1740-9705

DOI: 10.1111/j.1740-9713.2017.01069.x