Istvan Simon
- Cook, S. A. The Complexity of Theorem Proving Procedures, Third Annual ACM Symposium on Theory of Computing (1971). Google Scholar
Digital Library
- Karp, R. M. Reducibility Among Combinational Problems, in Complexity of Computer Computations, Miller and Thatcher (eds.), Plenum Press, (1973).Google Scholar
- Ladner, R., Lynch, N., Selman, A., Comparison of Polynomial-Time Reducibilities, Sixth Annual ACM Symposium on Theory of Computing, (1974). Google ScholarDigital Library
Index Terms
- Two results on polynomial-time reducibilities
Index terms have been assigned to the content through auto-classification.
Recommendations
Nontriviality for exponential time w.r.t. weak reducibilities
A set A is nontrivial for the linear exponential time class E=DTIME(2^l^i^n) if A@?E and the sets from E which can be reduced to A are not from a single level DTIME(2^k^n) of the linear exponential hierarchy. Similarly, a set A is nontrivial for the ...
Nontriviality for exponential time w.r.t weak reducibilities
TAMC'10: Proceedings of the 7th annual conference on Theory and Applications of Models of ComputationA set A is nontrivial for the linear exponential time class E=DTIME(2lin) if A∈E and the sets from E which can be reduced to A are not from a single level DTIME(2kn) of the linear exponential hierarchy Similarly, a set A is nontrivial for the polynomial ...
Comments