We propose a novel construction for the well-known prefer-max De Bruijnsequence . We show that the construction implies known results from the literature in a straightforward manner . It also forms analternative proof for the seminal FKM-theorem . We also show that it implies the correctness of onion-theoracle onion theorem and of the shift rules for preferred-max and prefer-min .

Author(s) : Gal Amram, Amir Rubin, Gera Weiss

Links : PDF - Abstract

Code :
Coursera

Keywords : construction - prefer - max - de - onion -

Leave a Reply

Your email address will not be published. Required fields are marked *