BPL (complexity) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "BPL (complexity)" in English language version.

refsWebsite

Global rank English rank

2doi.org

2^nd place

1web.archive.org

1^st place

1stanford.edu

179^th place

183^rd place

1psu.edu

207^th place

136^th place

1wisc.edu

1,045^th place

746^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

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

Borodin, A.; Cook, S. A.; Dymond, P. W.; Ruzzo, W. L.; Tompa, M. (1989), "Two applications of inductive counting for complementation problems", SIAM Journal on Computing, 18 (3): 559–578, CiteSeerX 10.1.1.394.1662, doi:10.1137/0218038
Nisan, N. (1994), "RL ⊆ SC", Computational Complexity, 4 (1): 1–11, doi:10.1007/BF01205052, An earlier version of this paper appeared at the 1992 Symposium on Theory of Computing

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

citeseerx.ist.psu.edu

Borodin, A.; Cook, S. A.; Dymond, P. W.; Ruzzo, W. L.; Tompa, M. (1989), "Two applications of inductive counting for complementation problems", SIAM Journal on Computing, 18 (3): 559–578, CiteSeerX 10.1.1.394.1662, doi:10.1137/0218038

stanford.edu (Global: 179^th place; English: 183^rd place)

qwiki.stanford.edu

"Complexity Zoo: BPL". Archived from the original on 2012-08-05. Retrieved 2011-10-04.

web.archive.org (Global: 1^st place; English: 1^st place)

"Complexity Zoo: BPL". Archived from the original on 2012-08-05. Retrieved 2011-10-04.

weizmann.ac.il (Global: 4,983^rd place; English: 8,002^nd place)

eccc.weizmann.ac.il

Hoza, William (2021). "Better Pseudodistributions and Derandomization for Space-Bounded Computation".

wisc.edu (Global: 1,045^th place; English: 746^th place)

pages.cs.wisc.edu

Complexity theory lecture notes

BPL (complexity) (English Wikipedia)

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

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