Parsimonious reduction (English Wikipedia)

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

refsWebsite

Global rank English rank

3books.google.com

3^rd place

1ieice.org

low place

1cornell.edu

332^nd place

246^th place

1doi.org

2^nd place

1worldcat.org

5^th place

1psu.edu

207^th place

136^th place

1jaist.ac.jp

low place

books.google.com (Global: 3^rd place; English: 3^rd place)

Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, pp. 203–204, ISBN 9781139472746
Flum, J.; Grohe, M. (2006), Parameterized Complexity Theory, EATCS Texts in Theoretical Computer Science, Springer, p. 363, ISBN 9783540299530
Gomes, Carla P.; Sabharwal, Ashish; Selman, Bart (2009), "Chapter 20. Model Counting", in Biere, Armin; Heule, Marijn; van Maaren, Hans; Walsh, Toby (eds.), Handbook of Satisfiability (PDF), Frontiers in Artificial Intelligence and Applications, vol. 185, IOS Press, pp. 633–654, ISBN 9781586039295. See in particular pp. 634–635.

cornell.edu (Global: 332^nd place; English: 246^th place)

cs.cornell.edu

Gomes, Carla P.; Sabharwal, Ashish; Selman, Bart (2009), "Chapter 20. Model Counting", in Biere, Armin; Heule, Marijn; van Maaren, Hans; Walsh, Toby (eds.), Handbook of Satisfiability (PDF), Frontiers in Artificial Intelligence and Applications, vol. 185, IOS Press, pp. 633–654, ISBN 9781586039295. See in particular pp. 634–635.

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

Lichtenstein, David (May 1982). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397.

ieice.org (Global: low place; English: low place)

search.ieice.org

Yato, Takayuki; Seta, Takahiro (2003), "Complexity and Completeness of Finding Another Solution and Its Application to Puzzles", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E86-A (5): 1052–1060

jaist.ac.jp (Global: low place; English: low place)

dspace.jaist.ac.jp

"JAIST Repository: Computational complexity and an integer programming model of Shakashaka". dspace.jaist.ac.jp. Retrieved 2019-05-15.

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

citeseerx.ist.psu.edu

Seta, Takahiro (2001). The Complexities of Puzzles, Cross Sum, and their Another Solution Problems (ASP). CiteSeerX 10.1.1.81.7891.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Lichtenstein, David (May 1982). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397.