Two results on polynomial-time reducibilities

Authors:
Istvan Simon
Affiliations:
Stanford University, Stanford, CA
Venue:
ACM SIGACT News
Year:
1976

Citing 2
Cited 1

Comparison of polynomial-time reducibilities

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Polynomial reducibilities and upward diagonalizations

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract