A Comparison of Weak Completeness Notions

@inproceedings{AmbosSpies1996ACO,
  title={A Comparison of Weak Completeness Notions},
  author={Klaus Ambos-Spies and Elvira Mayordomo and Xizhong Zheng},
  booktitle={IEEE Conference on Computational Complexity},
  year={1996}
}
We compare the weak completeness notions for E in the sense of Lutz’s resource-bounded measure theory [ l l ] with respect to the standara! polynomial t ime reducibilities. Our results parallel ?results for classical completeness b y Watanabe [17] and others. W e show that the weak completeness notions for 1-query reductions coincide: A set is weakl:y complete for E under 1-truth-table reducibility iff it is weakly complete for length-increasing one-one reducibility. For most of the other… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
12 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Re - source bounded randomness and weakly complete problems

  • S. A. Terwijn K. Ambos-Spies, X. Zheng.
  • Theoretical Computer Science ( to appear…
  • 1994

A note on 1truth-table complete sets

  • S. Homer, S . Kurtz, J . Royer
  • Theoretical Computer Science,
  • 1993

Polynomial reducibilities and complete sets

  • L. Berman
  • PhD. Thesis, Cornell University,
  • 1977

Similar Papers

Loading similar papers…