Enumeration reducibility (English Wikipedia)

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

refsWebsite

Global rank English rank

9doi.org

2^nd place

7worldcat.org

5^th place

2semanticscholar.org

11^th place

8^th place

2springer.com

274^th place

309^th place

1ams.org

451^st place

277^th place

1cambridge.org

305^th place

264^th place

1jstor.org

26^th place

20^th place

1psu.edu

207^th place

136^th place

ams.org

Myhill, John (1961). "Note on degrees of partial functions". Proceedings of the American Mathematical Society. 12 (4): 519–521. doi:10.1090/S0002-9939-1961-0125794-X. ISSN 0002-9939.

cambridge.org

Sacks, Gerald E. (December 1960). "Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569. S2CID 124102995.

doi.org

Shoenfield, J. R. (July 1969). "Theory of Recursive Functions and Effective Computability (Hartley Rogers, Jr.)". SIAM Review. 11 (3): 415–416. doi:10.1137/1011079. ISSN 0036-1445.
Myhill, John (1961). "Note on degrees of partial functions". Proceedings of the American Mathematical Society. 12 (4): 519–521. doi:10.1090/S0002-9939-1961-0125794-X. ISSN 0002-9939.
Sacks, Gerald E. (December 1960). "Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569. S2CID 124102995.
Case, John (1971-02-01). "Enumeration reducibility and partial degrees". Annals of Mathematical Logic. 2 (4): 419–439. doi:10.1016/0003-4843(71)90003-9. ISSN 0003-4843.
Soskova, Alexandra A.; Soskova, Mariya I. (2017), Day, Adam; Fellows, Michael; Greenberg, Noam; Khoussainov, Bakhadyr (eds.), "Enumeration Reducibility and Computable Structure Theory", Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol. 10010, Cham: Springer International Publishing, pp. 271–301, doi:10.1007/978-3-319-50062-1_19, ISBN 978-3-319-50062-1, retrieved 2020-12-18
Zheng, Xizhong; Rettinger, Robert (2004). "On the Extensions of Solovay-Reducibility". In Chwa, Kyung-Yong; Munro, J. Ian J. (eds.). Computing and Combinatorics. Lecture Notes in Computer Science. Vol. 3106. Berlin, Heidelberg: Springer. pp. 360–369. doi:10.1007/978-3-540-27798-9_39. ISBN 978-3-540-27798-9.
Omanadze, Roland Sh.; Sorbi, Andrea (2006-10-01). "Strong Enumeration Reducibilities". Archive for Mathematical Logic. 45 (7): 869–912. doi:10.1007/s00153-006-0012-4. ISSN 1432-0665. S2CID 44764613.
Cooper, S. Barry (1990). "Enumeration reducibility, nondeterministic computations and relative computability of partial functions". In Ambos-Spies, Klaus; Müller, Gert H.; Sacks, Gerald E. (eds.). Recursion Theory Week. Lecture Notes in Mathematics. Vol. 1432. Berlin, Heidelberg: Springer. pp. 57–110. doi:10.1007/BFb0086114. ISBN 978-3-540-47142-4.

dx.doi.org

Shoenfield, J. R. (July 1969). "Theory of Recursive Functions and Effective Computability (Hartley Rogers, Jr.)". SIAM Review. 11 (3): 415–416. doi:10.1137/1011079. ISSN 0036-1445.

jstor.org

Sacks, Gerald E. (December 1960). "Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569. S2CID 124102995.

psu.edu

citeseerx.ist.psu.edu

Harris, Charles Milton (2006). Enumeration Reducibility and Polynomial Time. CiteSeerX 10.1.1.95.8166.

semanticscholar.org

api.semanticscholar.org

Sacks, Gerald E. (December 1960). "Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569. S2CID 124102995.
Omanadze, Roland Sh.; Sorbi, Andrea (2006-10-01). "Strong Enumeration Reducibilities". Archive for Mathematical Logic. 45 (7): 869–912. doi:10.1007/s00153-006-0012-4. ISSN 1432-0665. S2CID 44764613.

springer.com

link.springer.com

Zheng, Xizhong; Rettinger, Robert (2004). "On the Extensions of Solovay-Reducibility". In Chwa, Kyung-Yong; Munro, J. Ian J. (eds.). Computing and Combinatorics. Lecture Notes in Computer Science. Vol. 3106. Berlin, Heidelberg: Springer. pp. 360–369. doi:10.1007/978-3-540-27798-9_39. ISBN 978-3-540-27798-9.
Cooper, S. Barry (1990). "Enumeration reducibility, nondeterministic computations and relative computability of partial functions". In Ambos-Spies, Klaus; Müller, Gert H.; Sacks, Gerald E. (eds.). Recursion Theory Week. Lecture Notes in Mathematics. Vol. 1432. Berlin, Heidelberg: Springer. pp. 57–110. doi:10.1007/BFb0086114. ISBN 978-3-540-47142-4.

worldcat.org

search.worldcat.org

Shoenfield, J. R. (July 1969). "Theory of Recursive Functions and Effective Computability (Hartley Rogers, Jr.)". SIAM Review. 11 (3): 415–416. doi:10.1137/1011079. ISSN 0036-1445.
Myhill, John (1961). "Note on degrees of partial functions". Proceedings of the American Mathematical Society. 12 (4): 519–521. doi:10.1090/S0002-9939-1961-0125794-X. ISSN 0002-9939.
Sacks, Gerald E. (December 1960). "Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569. S2CID 124102995.
Case, John (1971-02-01). "Enumeration reducibility and partial degrees". Annals of Mathematical Logic. 2 (4): 419–439. doi:10.1016/0003-4843(71)90003-9. ISSN 0003-4843.
Omanadze, Roland Sh.; Sorbi, Andrea (2006-10-01). "Strong Enumeration Reducibilities". Archive for Mathematical Logic. 45 (7): 869–912. doi:10.1007/s00153-006-0012-4. ISSN 1432-0665. S2CID 44764613.
Kleene, Stephen Cole, 1909-1994. (1971). Introduction to metamathematics. Groningen: Wolters-Noordhoff Pub. ISBN 0-7204-2103-9. OCLC 768949.{{cite book}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)

worldcat.org

Kleene, Stephen Cole, 1909-1994. (1971). Introduction to metamathematics. Groningen: Wolters-Noordhoff Pub. ISBN 0-7204-2103-9. OCLC 768949.{{cite book}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)