SL (計算複雑性理論) (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "SL (計算複雑性理論)" in Japanese language version.

refsWebsite

Global rank Japanese rank

low place

low place

1,185^th place

2,667^th place

207^th place

1,812^th place

4,983^rd place

low place

2,066^th place

low place

acm.org

A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa. Two applications of inductive counting for complementation problems. SIAM Journal on Computing, v.18 n.3, p.559-578. June 1989.

Carme Àlvarez and Raymond Greenlaw. A Compendium of Problems Complete for Symmetric Logarithmic Space. Computational Complexity,pp.9:73–95. 2000.

Omer Reingold. Undirected ST-connectivity in Log-Space. Electronic Colloquium on Computational Complexity. No. 94. (Draft PDF)

Noam Nisan and Amnon Ta-Shma. Symmetric logspace is closed under complement. Chicago Journal of Theoretical Computer Science. 1995.

Omer Reingold. Undirected ST-connectivity in Log-Space. Electronic Colloquium on Computational Complexity. No. 94. (Draft PDF)