SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Statistical Physics

Volumn 48, Issue 1-2, 1987, Pages 121-134

Two-dimensional monomer-dimer systems are computationally intractable

(1) Jerrum, Mark a

a UNIVERSITY OF EDINBURGH (United Kingdom)

Author keywords

P completeness; Computational complexity; Ising model; monomer dimer system

Indexed keywords

EID: 0009002383 PISSN: 00224715 EISSN: 15729613 Source Type: Journal
DOI: 10.1007/BF01010403 Document Type: Article

Times cited : (125)

References (14)

1
- 0001566238
- Statistical mechanics of dimers on a plane lattice
- (1961) Phys. Rev. , vol.124 , pp. 1664-1672
- Fisher, M.E.¹

2
- 0011027803
- On the dimer solution of planar Ising models
- (1966) J. Math. Phys. , vol.7 , pp. 1776-1781
- Fisher, M.E.¹

3
- 37049155115
- Statistical theory of perfect solutions
- (1937) Trans. Faraday Soc. , vol.33 , pp. 1272-1294
- Fowler, R.H.¹ Rushbrooke, G.S.²

4
- 84936262381
- M. R. Garey and D. S. Johnson, Computers and Intractability—A Guide to the Theory of NP-Completeness (Freeman, 1979).

5
- 0000199940
- Theory of monomer-dimer systems
- (1972) Commun. Math. Phys. , vol.25 , pp. 190-232
- Heilmann, O.J.¹ Lieb, E.H.²

6
- 84936264849
- J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, 1979).

7
- 0348168323
- The complexity of evaluating multivariate polynomials
- Department of Computer Science, University of Edinburgh
- (1981) Ph. D. Thesis CST-11–81
- Jerrum, M.R.¹

8
- 0001163746
- Dimer statistics and phase transitions
- (1963) J. Math. Phys. , vol.4 , pp. 287-293
- Kasteleyn, P.W.¹

9
- 84936294319
- P. W. Kasteleyn, Graph theory and crystal physics, in Graph Theory and Theoretical Physics, F. Harary, ed. (Academic Press, 1967), pp. 43–110.

10
- 84936227870
- J. K. Percus, Combinatorial Methods (Applied Mathematical Sciences 4, Springer-Verlag, 1971).

11
- 84936262444
- J. E. Savage, The Complexity of Computing (Wiley, 1976).

12
- 84996204867
- Dimer problem in statistical mechanics—An exact result
- (1961) Philosophical Magazine , vol.6 , pp. 1061-1063
- Temperley, H.N.V.¹ Fisher, M.E.²

13
- 49249151236
- The complexity of computing the permanent
- (1979) Theor. Computer Sci. , vol.8 , pp. 189-201
- Valiant, L.G.¹

14
- 0000142982
- The complexity of enumeration and reliability problems
- (1979) SIAM Journal on Computing , vol.8 , pp. 410-421
- Valiant, L.G.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.