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

2^nd place

1^st place

179^th place

183^rd place

207^th place

136^th place

1,045^th place

746^th place

4,983^rd place

8,002^nd place

doi.org

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

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

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

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