Abstract
A generalized reduction sub-exponential reduction family (SERF) is developed that preserves sub-exponential complexity. It is shown that Circuit-SAT is SERF-complete for all NP-search problems, and that for any fixed k, k-SAT, k-colorability, k-set cover, independent set, clique, vertex cover, are SERF-complete for the class SMP of search problems expressible by second order existential formulas whose first order part is universal.
Cite
CITATION STYLE
Impagliazzo, R., Paturi, R., & Zane, F. (1998). Which problems have strongly exponential complexity? In Annual Symposium on Foundations of Computer Science - Proceedings (pp. 653–662). IEEE Comp Soc. https://doi.org/10.1109/sfcs.1998.743516
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
