The difference between polynomial-time many-one and truth-table reducibilities on distributional problems

Theory of Computing Systems

Volumn 35, Issue 4, 2002, Pages 449-463

  Aida, Shin ^a   Schuler, Rainer ^b   Tsukiji, Tatsuie ^a   Watanabe, Osamu ^c  

^a NAGOYA UNIVERSITY   (Japan)

^b UNIVERSITY OF ULM   (Germany)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTIONAL PROBLEMS;

DECISION THEORY; POLYNOMIALS; SET THEORY;

PROBLEM SOLVING;

EID: 0036666111     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1025-y     Document Type: Conference Paper

References (17)

1. [AT] S. Aida and T. Tsukiji, On the difference among polynomial-time reducibilities for distributional problems (in Japanese), in Proc. of the LA Symposium, Winter, RIMS publication, 2000.
2. [BCGL] S. Ben-David, B. Chor, O. Goldreich, and M. Ludy, On the theory of average case complexity, J. Comput. System Sci., 44:193-219, 1992.
3. [BDG] J. Balcázar, J. Díaz, and J. Gabarŕ, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York, 1988.
4. [C] S. A. Cook, The complexity of theorem proving procedures, in Proc. of the Third ACM Symposium on Theory of Computing, ACM, New York, pp. 151-158, 1971.
5. [Ge] I. P. Gent, On the stupid algorithm for satisfiability, Research Report of the APES Group, APES-03-1998, http://www.des.st-and.ac.uk/ apes/apesreporcs.html, 1998.
6. [GK] A. Goerdt and M. Krivelevich, Efficient recognition of random unsatisfiable k-SAT instances by spectral methods, in Proc. of the 18th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 2010, Springer-Verlag, Berlin, pp. 294-394, 2001.
7. [Gu] Y. Gurevich, Average case completeness, J. Comput. System Sci., 42:346-398, 1991.
8. [H] S. Homer, Structural properties of complete problems for exponential time, in Complexity Theory Retrospective 2 (A. L. Selman, ed.), Springer-Verlag, New York, pp. 135-154, 1997.
9. [I] R. Impagliazzo, A personal view of average-case complexity, in Proc. 10th Conference on Structure in Complexity Theory, IEEE, New York, pp. 134-147, 1995.
10. [K] K. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, MA, 1991.
11. [KS] S. Kirkpatrick and B. Selman, Critical behaviour in satisfiablility of random Boolean expressions, Science, 264:1297-1301, 1994.
12. [L1] L. A. Levin, Universal sequential search problem, Problems Inform. Transmission, 9:265-266, 1973.
13. [L2] L. A. Levin, Average case completeness classes, SIAM J. Comput., 15:285-286, 1986.
14. [LLS] R. Ladner, N. Lynch, and A. Selman, A comparison of polynomial time reducibilities, Theoret. Comput. Sci., 1:103-123, 1975.
15. [LY] L. Longpré and P. Young, Cook reducibility is faster than Karp reducibility, J. Comput. System Sci., 41:389-401, 1990.
16. [VV] U. Vazirani and V. Vazirani, A natural encoding scheme proved probabilistic polynomial complete, Theoret. Comput. Sci., 24:291-300, 1983.
17. [W] J. Wang, Average-case computational complexity theory, in Complexity Theory Retrospective 2 (A. L. Selman, ed.), Springer-Verlag, New York, pp. 295-328, 1997.