Nancy Lynch
- 1 CooK, S. A. The complexity of theorem-proving procedures. Conf. Rec. Third ACM Syrup. on Theory of Computing, 1971, pp. 151-158. Google Scholar
- 2 KAnP, R. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-103.Google Scholar
- 3 LYNCH, N. Complexity-class encoding sets. Submitted fer publication.Google Scholar
- 4 LYNCH, N. Helping: Several formalizations. J. Symbolic Logic (to appear).Google Scholar
- 5 LYNch, N., MEYEn, A., AND FmcnEn, M. Relativization of the theory of computational complexity. Trans. AMS (to appear).Google Scholar
- 6 MEYER, A. Weak monadic second order theory of successor is not elementary-recursive. Manuscript, M.I.T., Cambridge, Mass., 1972. Google Scholar
- 7 STOCKMEYEn, L. Ph.D. Th., Dep. of Elec. Eng., M.I.T., Cambridge, Mass., June 1974.Google Scholar
- 8 SOLOVAY, R. Private communication.Google Scholar
Index Terms
- On Reducibility to Complex or Sparse Sets
Recommendations
On reductions of NP sets to sparse sets
Ogiwara and Watanabe showed that if SAT is bounded truth-table reducible to a sparse set, then P = NP. In this paper we simplify their proof, strengthen the result and use it to obtain several new results. Among the new results are the following:*...
Sparse Selfreducible Sets and Nonuniform Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets ...
Comments