Aanderaa–Karp–Rosenberg conjecture (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Aanderaa–Karp–Rosenberg conjecture" in English language version.

refsWebsite

Global rank English rank

9doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

4ams.org

451^st place

277^th place

3arxiv.org

69^th place

59^th place

2psu.edu

207^th place

136^th place

1acm.org

1,185^th place

840^th place

1harvard.edu

18^th place

17^th place

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

The result is unpublished, but mentioned in Magniez, Santha & Szegedy (2005). Magniez, Frédéric; Santha, Miklos; Szegedy, Mario (2005), "Quantum algorithms for the triangle problem", Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, British Columbia: Society for Industrial and Applied Mathematics, pp. 1109–1117, arXiv:quant-ph/0310134, Bibcode:2003quant.ph.10134M, ISBN 978-0-89871-585-9

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Kleitman & Kwiatkowski (1980); Kahn, Saks & Sturtevant (1984); Korneffel & Triesch (2010); Scheidweiler & Triesch (2013). Kleitman, D.J.; Kwiatkowski, DJ (1980), "Further results on the Aanderaa-Rosenberg conjecture", Journal of Combinatorial Theory, Series B, 28: 85–95, doi:10.1016/0095-8956(80)90057-X Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059 Korneffel, Torsten; Triesch, Eberhard (2010), "An asymptotic bound for the complexity of monotone graph properties", Combinatorica, 30 (6), Springer-Verlag: 735–743, doi:10.1007/s00493-010-2485-3, S2CID 27956060 Scheidweiler, Robert; Triesch, Eberhard (2013), "A lower bound for the complexity of monotone graph properties", SIAM Journal on Discrete Mathematics, 27 (1): 257–265, doi:10.1137/120888703
Kahn, Saks & Sturtevant (1984). Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059
Chakrabarti, Khot & Shi (2001). Chakrabarti, Amit; Khot, Subhash; Shi, Yaoyun (2001), "Evasiveness of subgraph containment and related properties", SIAM Journal on Computing, 31 (3): 866–875, CiteSeerX 10.1.1.29.3131, doi:10.1137/S0097539700382005, MR 1896462
Beals et al. (2001). Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald (2001), "Quantum lower bounds by polynomials", Journal of the ACM, 48 (4): 778–797, arXiv:quant-ph/9802049, doi:10.1145/502090.502097, MR 2144930

arxiv.org (Global: 69^th place; English: 59^th place)

Lovász & Young (2002). Lovász, László; Young, Neal E. (2002), "Lecture Notes on Evasiveness of Graph Properties", arXiv:cs/0205031v1
The result is unpublished, but mentioned in Magniez, Santha & Szegedy (2005). Magniez, Frédéric; Santha, Miklos; Szegedy, Mario (2005), "Quantum algorithms for the triangle problem", Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, British Columbia: Society for Industrial and Applied Mathematics, pp. 1109–1117, arXiv:quant-ph/0310134, Bibcode:2003quant.ph.10134M, ISBN 978-0-89871-585-9
Beals et al. (2001). Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald (2001), "Quantum lower bounds by polynomials", Journal of the ACM, 48 (4): 778–797, arXiv:quant-ph/9802049, doi:10.1145/502090.502097, MR 2144930

doi.org (Global: 2^nd place; English: 2^nd place)

Rosenberg (1973). Rosenberg, Arnold L. (1973), "On the time required to recognize properties of graphs: a problem", SIGACT News, 5 (4): 15–16, doi:10.1145/1008299.1008302
Triesch (1996). Triesch, Eberhard (1996), "On the recognition complexity of some graph properties", Combinatorica, 16 (2): 259–268, doi:10.1007/BF01844851, S2CID 40830285
Rivest & Vuillemin (1975). Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proceedings of the 7th ACM Symposium on Theory of Computing (STOC 1975): Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596
Kleitman & Kwiatkowski (1980); Kahn, Saks & Sturtevant (1984); Korneffel & Triesch (2010); Scheidweiler & Triesch (2013). Kleitman, D.J.; Kwiatkowski, DJ (1980), "Further results on the Aanderaa-Rosenberg conjecture", Journal of Combinatorial Theory, Series B, 28: 85–95, doi:10.1016/0095-8956(80)90057-X Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059 Korneffel, Torsten; Triesch, Eberhard (2010), "An asymptotic bound for the complexity of monotone graph properties", Combinatorica, 30 (6), Springer-Verlag: 735–743, doi:10.1007/s00493-010-2485-3, S2CID 27956060 Scheidweiler, Robert; Triesch, Eberhard (2013), "A lower bound for the complexity of monotone graph properties", SIAM Journal on Discrete Mathematics, 27 (1): 257–265, doi:10.1137/120888703
Lutz (2001). Lutz, Frank H. (2001), "Some results related to the evasiveness conjecture", Journal of Combinatorial Theory, Series B, 81 (1): 110–124, doi:10.1006/jctb.2000.2000
Kahn, Saks & Sturtevant (1984). Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059
Yao (1988). Yao, Andrew Chi-Chih (1988), "Monotone bipartite graph properties are evasive", SIAM Journal on Computing, 17 (3): 517–520, doi:10.1137/0217031
Chakrabarti, Khot & Shi (2001). Chakrabarti, Amit; Khot, Subhash; Shi, Yaoyun (2001), "Evasiveness of subgraph containment and related properties", SIAM Journal on Computing, 31 (3): 866–875, CiteSeerX 10.1.1.29.3131, doi:10.1137/S0097539700382005, MR 1896462
Beals et al. (2001). Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald (2001), "Quantum lower bounds by polynomials", Journal of the ACM, 48 (4): 778–797, arXiv:quant-ph/9802049, doi:10.1145/502090.502097, MR 2144930

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

The result is unpublished, but mentioned in Magniez, Santha & Szegedy (2005). Magniez, Frédéric; Santha, Miklos; Szegedy, Mario (2005), "Quantum algorithms for the triangle problem", Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, British Columbia: Society for Industrial and Applied Mathematics, pp. 1109–1117, arXiv:quant-ph/0310134, Bibcode:2003quant.ph.10134M, ISBN 978-0-89871-585-9

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Rivest & Vuillemin (1975). Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proceedings of the 7th ACM Symposium on Theory of Computing (STOC 1975): Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596
Chakrabarti, Khot & Shi (2001). Chakrabarti, Amit; Khot, Subhash; Shi, Yaoyun (2001), "Evasiveness of subgraph containment and related properties", SIAM Journal on Computing, 31 (3): 866–875, CiteSeerX 10.1.1.29.3131, doi:10.1137/S0097539700382005, MR 1896462

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Triesch (1996). Triesch, Eberhard (1996), "On the recognition complexity of some graph properties", Combinatorica, 16 (2): 259–268, doi:10.1007/BF01844851, S2CID 40830285
Rivest & Vuillemin (1975). Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proceedings of the 7th ACM Symposium on Theory of Computing (STOC 1975): Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596
Kleitman & Kwiatkowski (1980); Kahn, Saks & Sturtevant (1984); Korneffel & Triesch (2010); Scheidweiler & Triesch (2013). Kleitman, D.J.; Kwiatkowski, DJ (1980), "Further results on the Aanderaa-Rosenberg conjecture", Journal of Combinatorial Theory, Series B, 28: 85–95, doi:10.1016/0095-8956(80)90057-X Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059 Korneffel, Torsten; Triesch, Eberhard (2010), "An asymptotic bound for the complexity of monotone graph properties", Combinatorica, 30 (6), Springer-Verlag: 735–743, doi:10.1007/s00493-010-2485-3, S2CID 27956060 Scheidweiler, Robert; Triesch, Eberhard (2013), "A lower bound for the complexity of monotone graph properties", SIAM Journal on Discrete Mathematics, 27 (1): 257–265, doi:10.1137/120888703
Kahn, Saks & Sturtevant (1984). Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1984), "A topological approach to evasiveness", Combinatorica, 4 (4): 297–306, doi:10.1007/BF02579140, MR 0779890, S2CID 5215059

Aanderaa–Karp–Rosenberg conjecture (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)