Publisher
Springer Nature Switzerland
Reference21 articles.
1. Àvarez, C., Greenlaw, R.: A compendium of problems complete for symmetric space. Comput. Complex. 9, 123–145 (2000)
2. Bringman, K., Cassis, A., Fisher, N., Künnemann, M.: Fine-grained completeness for optimization in P. In: APPROX/RANDOM 2021, LIPIcs, vol. 207, pp. 9:1–9:22 (2021). An extended version is available at arXiv:2107.01721
3. Cook, S.A.: The complexity of theorem-proving procedures. In: STOC’71, pp. 151–158 (1971)
4. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inform. Control 64, 2–22 (1985)
5. Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: STOC’93, pp. 612–622 (1993)