Skip to main content
Log in

The Value of Help Bits in Randomized and Average-Case Complexity

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

“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. In this paper, we study the value of help bits in the settings of randomized and average-case complexity.

If k instances of a decision problem can be efficiently solved using \({\ell < k}\) help bits, then without access to help bits one can efficiently compute a k-bit vector that is not equal to the k-bit vector of solutions to the k instances. A decision problem with this property is called k-membership comparable.

Amir, Beigel, and Gasarch (1990) show that for constant k, all k-membership comparable languages are in P/poly. We extend this result to the setting of randomized computation: We show that for k at most logarithmic, the decision problem is k-membership comparable if using \({\ell}\) help bits, k instances of the problem can be efficiently solved with probability greater than \({2^{\ell-k}}\). The same conclusion holds if using less than \({k(1 - h(\alpha))}\) help bits (where \({h(\cdot)}\) is the binary entropy function), we can efficiently solve \({1-\alpha}\) fraction of the instances correctly with non-vanishing probability. We note that when k is constant, k-membership comparability implies being in P/poly.

Next we consider the setting of average-case complexity: Assume that we can 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 we can efficiently solve an instance drawn from that distribution with probability better than 1/2. Finally, we show that in the case where k is super-logarithmic, assuming k-membership comparability of a decision problem, one cannot prove that the problem is in P/poly by a “relativizing" proof technique. All previous known proofs in this area have been relativizing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Manindra Agrawal & Vikraman Arvind (1994). Polynomial time truth-table reductions to P-selective sets. In Proceedings of 9th Annual IEEE Conference on Computational Complexity, 24–30. IEEE.

  • Amir Amihood, Beigel Richard, Gasarch William (2003) Some connections between bounded query classes and non-uniform complexity. Information and Computation 186(1): 104–139

    Article  MathSciNet  MATH  Google Scholar 

  • Amihood Amir, Richard Beigel & William I Gasarch (1990). Some connections between bounded query classes and nonuniform complexity. In Proceedings of 5th Annual IEEE Conference on Computational Complexity, 232–243. IEEE.

  • Richard Beigel (1987). Query-limited reducibilities. Ph.D. thesis, Stanford University.

  • Richard Beigel, Lance Fortnow & A Pavan (2002). Membership comparable and p-selective sets. Technical report, 2002-006N, NEC Research Institute.

  • Richard Beigel & Tirza Hirst (1998). One help-bit doesn’t help. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, 124–130. ACM.

  • Beigel Richard, Kummer Martin, Stephan Frank (1995) Approximable sets. Information and Computation 120(2): 304–314

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Jin-yi (1990) Lower bounds for constant-depth circuits in the presence of help bits. Information Processing Letters 36(2): 79–83

    Article  MathSciNet  MATH  Google Scholar 

  • Jin-Yi Cai & Lane A Hemachandra (1988). Enumerative counting is hard. In Proceedings of 3rd Annual IEEE Conference on Computational Complexity, 194–203. IEEE.

  • William Gasarch (1985). The complexity of optimization functions. Technical report, 1652, Department of Computer Science, University of Maryland.

  • Gasarch William I., Krentel Mark W., Rappoport Kevin J. (1995) OptP as the normal behavior of NP-complete problems. Mathematical Systems Theory 28(6): 487–514

    Article  MathSciNet  MATH  Google Scholar 

  • Oded Goldreich, Noam Nisan & Avi Wigderson (2011). On Yaos XOR-lemma. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 273–301. Springer.

  • Healy Alexander, Vadhan Salil, Viola Emanuele (2006) Using nondeterminism to amplify hardness. SIAM Journal on Computing 35(4): 903–931

    Article  MathSciNet  MATH  Google Scholar 

  • Maren Hinrichs & Gerd Wechsung (1997). Time bounded frequency computations. In Proceedings of Twelfth Annual IEEE Conference on Computational Complexity, 185–192. IEEE.

  • Russell Impagliazzo (1995). Hard-core distributions for somewhat hard problems. In Proceedings of 36th IEEE Annual Symposium on Foundations of Computer Science, 538–545. IEEE.

  • Johannes Köbler (1995). On the structure of low sets. In Proceedings of 10th Annual IEEE Conference on Computational Complexity, 246–261. IEEE.

  • Mark W Krentel (1988). The complexity of optimization problems. Journal of computer and system sciences 36(3), 490–509.

  • Florence Jessie MacWilliams & Neil James Alexander Sloane (1977). The theory of error correcting codes, volume 16. Elsevier.

  • Nisan Noam, Rudich Steven, Saks Michael (1998) Products and help bits in decision trees. SIAM Journal on Computing 28(3): 1035–1050

    Article  MathSciNet  MATH  Google Scholar 

  • Ryan O’Donnell (2002). Hardness amplification within NP. In Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, 751–760. ACM.

  • Ogihara Mitsunori (1995) Polynomial-time membership comparable sets. SIAM Journal on Computing 24(5): 1068–1081

    Article  MathSciNet  MATH  Google Scholar 

  • Ogihara Mitsunori, Tantau Till (2004) On the reducibility of sets inside NP to sets with low information content. Journal of Computer and System Sciences 69(4): 499–524

    Article  MathSciNet  MATH  Google Scholar 

  • Shannon Claude et al (1949) The synthesis of two-terminal switching circuits. Bell System Technical Journal 28(1): 59–98

    Article  MathSciNet  Google Scholar 

  • D Sivakumar (1998). On membership comparable sets. In Proceedings of Thirteenth Annual IEEE Conference on Computational Complexity, 2–7. IEEE.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Omid Etesami.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Beigi, S., Etesami, O. & Gohari, A. The Value of Help Bits in Randomized and Average-Case Complexity. comput. complex. 26, 119–145 (2017). https://doi.org/10.1007/s00037-016-0135-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-016-0135-x

Keywords

Subject classification

Navigation