FKT algoritam (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "FKT algoritam" in Serbian language version.
refsWebsite
Global rank
Serbian rank
7,231st place
3,292nd place
1st place
1st place
942nd place
2,000th place
4,448th place
5,278th place
low place
low place
americanscientist.org
- Hayes, Brian (2008), „Accidental Algorithms”, American Scientist
ams.org
- Kenyon, Richard; Okounkov, Andrei (2005). „What is a Dimer?” (PDF). AMS. 52 (3): 342—343.
anu.edu.au
tpsrv.anu.edu.au
- Baxter, R. J. (2008) [1982]. Exactly Solved Models in Statistical Mechanics (Third изд.). Dover Publications. стр. 11. ISBN 978-0-486-46271-4. Архивирано из оригинала 20. 03. 2012. г. Приступљено 31. 05. 2013.
arxiv.org
- Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010). Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE. arXiv:1008.0683
.
brown.edu
cs.brown.edu
- Valiant, Leslie G. (2004). „Holographic Algorithms (Extended Abstract)”. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. FOCS'04. Rome, Italy: IEEE Computer Society. стр. 306—315. ISBN 978-0-7695-2228-9. doi:10.1109/FOCS.2004.34. Архивирано из оригинала
|archive-url=захтева|url=(помоћ) 13. 03. 2012. г.
doi.org
- Kasteleyn, P. W. (1961), „The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice”, Physica, 27 (12): 1209—1225, doi:10.1016/0031-8914(61)90063-5
- Temperley, H. N. V.; Fisher, Michael E. (1961). „Dimer problem in statistical mechanics-an exact result”. Philosophical Magazine. 6 (68): 1061—1063. doi:10.1080/14786436108243366.
- Kasteleyn, P. W. (1963). „Dimer Statistics and Phase Transitions”. Journal of Mathematical Physics. 4 (2): 287—293. doi:10.1063/1.1703953.
- Vazirani, Vijay V. (1988), „NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems”, Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT '88), Lecture Notes in Computer Science, 318, Springer-Verlag, стр. 233—242, doi:10.1007/3-540-19487-8_27
- Valiant, Leslie G. (2004). „Holographic Algorithms (Extended Abstract)”. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. FOCS'04. Rome, Italy: IEEE Computer Society. стр. 306—315. ISBN 978-0-7695-2228-9. doi:10.1109/FOCS.2004.34. Архивирано из оригинала
|archive-url=захтева|url=(помоћ) 13. 03. 2012. г.
gatech.edu
people.math.gatech.edu
- Thomas, Robin (2006). A survey of Pfaffian orientations of graphs (PDF). International Congress of Mathematicians. III. Zurich: European Mathematical Society. стр. 963—984.
icm2006.org
- Thomas, Robin (2006). A survey of Pfaffian orientations of graphs (PDF). International Congress of Mathematicians. III. Zurich: European Mathematical Society. стр. 963—984.
unlv.edu
egr.unlv.edu
- Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010). Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE. arXiv:1008.0683 .
web.archive.org
- Baxter, R. J. (2008) [1982]. Exactly Solved Models in Statistical Mechanics (Third изд.). Dover Publications. стр. 11. ISBN 978-0-486-46271-4. Архивирано из оригинала 20. 03. 2012. г. Приступљено 31. 05. 2013.