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

메뉴 건너뛰기

Random Structures and Algorithms

Volumn 23, Issue 2, 2003, Pages 133-154

The Computational Complexity of Two-State Spin Systems

(3) Goldberg, Leslie Ann a Jerrum, Mark b Paterson, Mike a

a UNIVERSITY OF WARWICK (United Kingdom)

b UNIVERSITY OF EDINBURGH (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041876315 PISSN: 10429832 EISSN: None Source Type: Journal
DOI: 10.1002/rsa.10090 Document Type: Article

Times cited : (70)

References (9)

1
- 84887471044
- On some tighter inapproximability results (extended abstract)
- Springer-Verlag, New York
- P. Berman and M. Karpinski, On some tighter inapproximability results (extended abstract), Proc 26th EATCS Int Coll Automata, Languages and Programming (ICALP), Springer-Verlag, New York, 1999, pp. 200-209.
- (1999) Proc 26th EATCS Int Coll Automata, Languages and Programming (ICALP) , pp. 200-209
- Berman, P.¹ Karpinski, M.²

2
- 0031359702
- Path coupling: A technique for proving rapid mixing in Markov chains
- IEEE, Los Alamitos
- R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, Proc 38th IEEE Annu Symp Foundations of Computer Science, IEEE, Los Alamitos, 1997, pp. 223-231.
- (1997) Proc 38th IEEE Annu Symp Foundations of Computer Science , pp. 223-231
- Bubley, R.¹ Dyer, M.²

3
- 0002657015
- Random walks on combinatorial objects
- Eds. J. D. Lamb and D. A. Preece, London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge
- M. Dyer and C. Greenhill, "Random walks on combinatorial objects," Surveys in combinatorics 1999, Eds. J. D. Lamb and D. A. Preece, London Mathematical Society Lecture Note Series 27, 101-136. Cambridge University Press, Cambridge, 1999.
- (1999) Surveys in Combinatorics 1999 , vol.27 , pp. 101-136
- Dyer, M.¹ Greenhill, C.²

4
- 0034369431
- The complexity of counting graph homomorphisms
- M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms, Random Structures Algorithms 17 (2000), 260-289.
- (2000) Random Structures Algorithms , vol.17 , pp. 260-289
- Dyer, M.¹ Greenhill, C.²

5
- 84937395480
- On the relative complexity of approximate counting problems
- Springer-Verlag, New York
- M. Dyer, C. Greenhill, L. A. Goldberg, and M. Jerrum, On the relative complexity of approximate counting problems, Proc APPROX. Springer Lecture Notes in Computer Science 1913, Springer-Verlag, New York, 2000, pp. 108-119.
- (2000) Proc APPROX, Springer Lecture Notes in Computer Science 1913 , pp. 108-119
- Dyer, M.¹ Greenhill, C.² Goldberg, L.A.³ Jerrum, M.⁴

6
- 0242369073
- Sampling and counting
- Chapter 3 Lecture notes from a recent Nachdiplomvorlesung at ETH-Zürich
- M. Jerrum, Sampling and counting, Chapter 3 Lecture notes from a recent Nachdiplomvorlesung at ETH-Zürich "Counting, sampling and integrating: Algorithms and complexity," http://www.dcs.ed.ac.uk/home/mrj/pubs.html.
- Counting, Sampling and Integrating: Algorithms and Complexity
- Jerrum, M.¹

7
- 0027677367
- Polynomial-time approximation algorithms for the Ising model
- M. Jerrum and A. Sinclair, Polynomial-time approximation algorithms for the Ising model, SIAM J Comput 22 (1993), 1087-1116.
- (1993) SIAM J Comput , vol.22 , pp. 1087-1116
- Jerrum, M.¹ Sinclair, A.²

8
- 38249043088
- Random generation of combinatorial structures from a uniform distribution
- M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret Comput Sci 43 (1986), 169-188.
- (1986) Theoret Comput Sci , vol.43 , pp. 169-188
- Jerrum, M.R.¹ Valiant, L.G.² Vazirani, V.V.³

9
- 0033436481
- Fast convergence of the Glauber dynamics for sampling independent sets
- M. Luby and E. Vigoda, Fast convergence of the Glauber dynamics for sampling independent sets, Random Structures Algorithms 15 (1999), 229-241.
- (1999) Random Structures Algorithms , vol.15 , pp. 229-241
- Luby, M.¹ Vigoda, E.²

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