Loading...

The value of information-theoretic content of help bits for computation

Beigi, S ; Sharif University of Technology | 2015

486 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IWCIT.2015.7140205
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2015
  4. Abstract:
  5. 'Help bits' are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. Assume that we can efficiently solve k instances of a decision problem using some help bits whose entropy is less than k when the k instances are drawn independently from a particular distribution. Then there is an upper bound on the average-case complexity of the problem, namely we can efficiently solve an instance drawn from that distribution correctly with probability better than 1/2
  6. Keywords:
  7. Probability distributions ; Average-case complexity ; Computational problem ; Decision problems ; Particular distribution ; Upper Bound ; Value of information ; Information theory
  8. Source: IWCIT 2015 - Iran Workshop on Communication and Information Theory, 6 May 2015 through 7 May 2015 ; 2015 ; 9781479982356 (ISBN)
  9. URL: http://ieeexplore.ieee.org/document/7140205/?reload=true&arnumber=7140205