How to recycle your facets

نویسندگان

چکیده

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

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

منابع مشابه

How to recycle your facets

We show how to transform any inequality defining a facet of some 0/1-polytope into an inequality defining a facet of the acyclic subgraph polytope. While this facet-recycling procedure can potentially be used to construct ‘nasty’ facets, it can also be used to better understand and extend the polyhedral theory of the acyclic subgraph and linear ordering problems.

متن کامل

How to Recycle Random Bits

We show that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r + k) bits are needed to improve this probability to 1 − 2−k. We also present a different pseudo-ran...

متن کامل

How to Boost Your Immune System Against Corona-virus Infection?

New emerging viruses like coronavirus 2019 (COVID-19) infections are always frightening. We know little about theirtransmission, behaviors, clinical manifestations, and outcomes. There is no vaccine or therapeutic strategies to dealwith these infections yet. In this situation, preventive measures may be promising. Hand hygiene is a very importantissue in preventing viral infec...

متن کامل

How to Recycle Shares in Secret Sharing Schemes

A (t, w) threshold scheme is a method for sharing a secret among w shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. This paper is concerned with the re-use of shares possessed by shareholders in threshold schemes. We propose a simple (t, w) threshold scheme based on the use of the pseudo-random function family and the unive...

متن کامل

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


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

ژورنال

عنوان ژورنال: Discrete Optimization

سال: 2006

ISSN: 1572-5286

DOI: 10.1016/j.disopt.2005.10.007