Computing on Binary Strings
صفحه : 9 زبان :  سال : 2011 میلادی حجم : 129.3 کیلوبایت رسته : رسته : 

پردازش رشته های دودویی



Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of binary strings and several operations like conjunction and disjunction, which new binary strings can be generated? Although it is a fundamental problem, to the best of our knowledge, the problem hasn’t been studied yet. In this paper, an O(m2n) algorithm is presented to determine whether a string s is representable by a set W , where n is the number of strings in W and each string has the same length m. However, looking for the minimum subset from a set to represent a given string is shown to be NP-hard. In addition, we prove that counting the number of strings representable is #P-complete. But if the operator negation can be used, the number is some power of 2. This difference maybe help us understand the problem more profoundly.

دانلود

دانلود کتاب Computing on Binary Strings

download book Computing on Binary Strings

کتابخانه

download

دانلود کتاب

Farnabaz يكشنبه 13 آذر 1390 - 22:28 گزارش خطا

ارسال نظر

(If you're a human, don't change the following field)
Your first name.
محتویات این فیلد مخفی مانده و بصورت عمومی نمایش داده نمی شود.

آمار کتابخانه

  • کتاب های موجود: 1346
  • کتاب های صوتی: 24
  • کتاب های موبایل: 54
  • کتاب های فارسی: 813
  • کتاب های لاتین: 529