Gap reduction (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Gap reduction" in English language version.

refsWebsite

Global rank English rank

415^th place

327^th place

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

1,185^th place

840^th place

69^th place

59^th place

acm.org

doi.acm.org

Johan, Hastad (July 2001). "Some Optimal Inapproximability Results". J. ACM. 48 (4). ACM: 798–859. doi:10.1145/502090.502098. S2CID 5120748.

arxiv.org

Manurangsi, Pasin; Moshkovitz, Dana (2013). "Improved Approximation Algorithms for Projection Games". Esa 2013. 8125 (2). ESA: 683–694. arXiv:1408.4048. doi:10.1007/s00453-015-0088-5. S2CID 12959740.

doi.org

Johan, Hastad (July 2001). "Some Optimal Inapproximability Results". J. ACM. 48 (4). ACM: 798–859. doi:10.1145/502090.502098. S2CID 5120748.
Manurangsi, Pasin; Moshkovitz, Dana (2013). "Improved Approximation Algorithms for Projection Games". Esa 2013. 8125 (2). ESA: 683–694. arXiv:1408.4048. doi:10.1007/s00453-015-0088-5. S2CID 12959740.

mit.edu

courses.csail.mit.edu

Demaine, Erik (Fall 2014). $6$ .890/fall14/scribe/lec12.pdf "Algorithmic Lower Bounds: Fun with Hardness Proofs Lecture 12 Notes" (PDF). {{cite web}}: Check |url= value (help)
Demaine, Erik (Fall 2014). "Algorithmic Lower Bounds: Fun with Hardness Proofs Lecture 12 Notes" (PDF).

semanticscholar.org

api.semanticscholar.org

Johan, Hastad (July 2001). "Some Optimal Inapproximability Results". J. ACM. 48 (4). ACM: 798–859. doi:10.1145/502090.502098. S2CID 5120748.
Manurangsi, Pasin; Moshkovitz, Dana (2013). "Improved Approximation Algorithms for Projection Games". Esa 2013. 8125 (2). ESA: 683–694. arXiv:1408.4048. doi:10.1007/s00453-015-0088-5. S2CID 12959740.