A lower bound for the hitting set size for combinatorial rectangles and an application
مقال من تأليف: Chandran, Sunil L. ;
ملخص: We prove a lower bound of where for the hitting set size for combinatorial rectangles of volume at least in [m]d space, for and d>2.
لغة:
إنجليزية