Isolation lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Isolation lemma" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

207^th place

136^th place

low place

low place

1uni-frankfurt.de

4,572^nd place

7,417^th place

7,948^th place

5,350^th place

2,691^st place

1,948^th place

6^th place

6^th place

1,185^th place

840^th place

69^th place

59^th place

18^th place

17^th place

acm.org

portal.acm.org

Arvind, Mukhopadhyay & Srinivasan (2008) Arvind, V.; Mukhopadhyay, Partha; Srinivasan, Srikanth (2008). New Results on Noncommutative and Commutative Polynomial Identity Testing. Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity. IEEE Computer Society. pp. 268–279. arXiv:0801.0514. Bibcode:2008arXiv0801.0514A. ISBN 978-0-7695-3169-4. Retrieved 2010-05-10.

archive.org

Hemaspaandra & Ogihara (2002) Hemaspaandra, Lane A.; Ogihara, Mitsunori (2002). "Chapter 4. The Isolation Technique" (PDF). The complexity theory companion. Springer. ISBN 978-3-540-67419-1.

arxiv.org

Arvind, Mukhopadhyay & Srinivasan (2008) Arvind, V.; Mukhopadhyay, Partha; Srinivasan, Srikanth (2008). New Results on Noncommutative and Commutative Polynomial Identity Testing. Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity. IEEE Computer Society. pp. 268–279. arXiv:0801.0514. Bibcode:2008arXiv0801.0514A. ISBN 978-0-7695-3169-4. Retrieved 2010-05-10.

doi.org

Mulmuley, Vazirani & Vazirani (1987) Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix inversion". Combinatorica. 7 (1): 105–113. CiteSeerX 10.1.1.70.2247. doi:10.1007/BF02579206.
Reinhardt & Allender (2000) Reinhardt, K.; Allender, E. (2000). "Making Nondeterminism Unambiguous" (PDF). SIAM Journal on Computing. 29 (4): 1118. doi:10.1137/S0097539798339041.
Majumdar & Wong (2001) Majumdar, Rupak; Wong, Jennifer L. (2001). Watermarking of SAT using combinatorial isolation lemmas. Proceedings of the 38th annual Design Automation Conference. Las Vegas, Nevada, United States: ACM. pp. 480–485. CiteSeerX 10.1.1.16.9300. doi:10.1145/378239.378566. ISBN 1-58113-297-2.

harvard.edu

ui.adsabs.harvard.edu

Arvind, Mukhopadhyay & Srinivasan (2008) Arvind, V.; Mukhopadhyay, Partha; Srinivasan, Srikanth (2008). New Results on Noncommutative and Commutative Polynomial Identity Testing. Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity. IEEE Computer Society. pp. 268–279. arXiv:0801.0514. Bibcode:2008arXiv0801.0514A. ISBN 978-0-7695-3169-4. Retrieved 2010-05-10.

hpi-web.de

eccc.hpi-web.de

Noam Ta-Shma (2015); A simple proof of the Isolation Lemma, in eccc

ias.edu

math.ias.edu

Wigderson (1994) Wigderson, Avi (1994). NL/poly ⊆ ⊕L/poly (PDF). Proceedings of the 9th Structures in Complexity Conference. pp. 59–62.

psu.edu

citeseerx.ist.psu.edu

Mulmuley, Vazirani & Vazirani (1987) Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix inversion". Combinatorica. 7 (1): 105–113. CiteSeerX 10.1.1.70.2247. doi:10.1007/BF02579206.
Majumdar & Wong (2001) Majumdar, Rupak; Wong, Jennifer L. (2001). Watermarking of SAT using combinatorial isolation lemmas. Proceedings of the 38th annual Design Automation Conference. Las Vegas, Nevada, United States: ACM. pp. 480–485. CiteSeerX 10.1.1.16.9300. doi:10.1145/378239.378566. ISBN 1-58113-297-2.

rochester.edu

cs.rochester.edu

Hemaspaandra & Ogihara (2002) Hemaspaandra, Lane A.; Ogihara, Mitsunori (2002). "Chapter 4. The Isolation Technique" (PDF). The complexity theory companion. Springer. ISBN 978-3-540-67419-1.

uni-frankfurt.de

lovelace.thi.informatik.uni-frankfurt.de

Jukna (2001) Jukna, Stasys (2001). Extremal combinatorics: with applications in computer science. Springer. pp. 147–150. ISBN 978-3-540-66313-3.