TFNP (English Wikipedia)

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

refsWebsite

Global rank English rank

6arxiv.org

69^th place

59^th place

2dagstuhl.de

low place

1iacr.org

5,032^nd place

3,357^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1stanford.edu

179^th place

183^rd place

1cuni.cz

3,645^th place

6,045^th place

1acm.org

1,185^th place

840^th place

1quantamagazine.org

6,413^th place

4,268^th place

1doi.org

2^nd place

1semanticscholar.org

11^th place

8^th place

acm.org

dl.acm.org

Daskalakis and Papadimitriou. Continuous Local Search. SODA 2011.

arxiv.org

Sotiraki, Zampetakis, and Zidelis. PPP-Completeness with Connections to Cryptography. FOCS 2018
Fearnley, John; Goldberg, Paul W.; Hollender, Alexandros; Savani, Rahul (11 November 2020). "The Complexity of Gradient Descent: CLS = PPAD ∩ PLS". arXiv:2011.01929 [cs.CC].
Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul (December 2020). "Unique end of potential line". Journal of Computer and System Sciences. 114: 1–35. arXiv:1811.03841. doi:10.1016/j.jcss.2020.05.007. S2CID 220277586.
Daskalakis, Constantinos; Tzamos, Christos; Zampetakis, Manolis (13 February 2018). "A Converse to Banach's Fixed Point Theorem and its CLS Completeness". arXiv:1702.07339 [cs.CC].
Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul (7 April 2017). "CLS: New Problems and Completeness". arXiv:1702.06017 [cs.CC].
Chiu, Man-Kwun; Choudhary, Aruni; Mulzer, Wolfgang (20 March 2020). "Computational Complexity of the α-Ham-Sandwich Problem". arXiv:2003.09266 [cs.CG].

cuni.cz

karlin.mff.cuni.cz

Johnson, Papadimitriou, and Yannakakis. How Easy is Local Search?. Journal of Computer System Sciences, 1988.

dagstuhl.de

drops.dagstuhl.de

Goldberg and Papadimitriou. Towards a Unified Complexity Theory of Total Functions. 2018.
Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul (December 2020). "Unique end of potential line". Journal of Computer and System Sciences. 114: 1–35. arXiv:1811.03841. doi:10.1016/j.jcss.2020.05.007. S2CID 220277586.

doi.org

Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul (December 2020). "Unique end of potential line". Journal of Computer and System Sciences. 114: 1–35. arXiv:1811.03841. doi:10.1016/j.jcss.2020.05.007. S2CID 220277586.

iacr.org

eprint.iacr.org

Garg, Pandey, and Srinivasan. Revisiting Cryptographic Hardness of Finding a Nash Equilibrium. CRYPTO 2016.

quantamagazine.org

Thieme, Nick (2021-08-17). "Computer Scientists Discover Limits of Major Research Algorithm". Quanta Magazine. Retrieved 2021-08-17.

semanticscholar.org

api.semanticscholar.org

Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul (December 2020). "Unique end of potential line". Journal of Computer and System Sciences. 114: 1–35. arXiv:1811.03841. doi:10.1016/j.jcss.2020.05.007. S2CID 220277586.

stanford.edu

theory.stanford.edu

Megiddo and Papadimitriou. A Note on Total Functions, Existence Theorems and Computational Complexity. Theoretical Computer Science 1989.

weizmann.ac.il

eccc.weizmann.ac.il

Habàcek and Yogev. Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SODA 2016.