SCOPUS 정보 검색 플랫폼

Volumn 292, Issue 1-3, 1999, Pages 15-37

How fast can one compute the permanent of circulant matrices?

b CNR (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033424952 PISSN: 00243795 EISSN: None Source Type: Journal
DOI: 10.1016/S0024-3795(99)00012-9 Document Type: Article

Times cited : (10)

References (14)

1
- 51249195874
- Theorems in the additive theory of numbers
- R.C. Bose, S. Chowla, Theorems in the additive theory of numbers, Comment. Math. Elvet. 37 (1962) 141-147.
- (1962) Comment. Math. Elvet. , vol.37 , pp. 141-147
- Bose, R.C.¹ Chowla, S.²

2
- 0003996707
- Cambridge University Press, Cambridge
- R.A. Brualdi, B.L. Shader, Matrices of Sign-Solvable Linear Systems, Cambridge University Press, Cambridge, 1995.
- (1995) Matrices of Sign-solvable Linear Systems
- Brualdi, R.A.¹ Shader, B.L.²

3
- 0039504485
- On the permanent of certain (0,1) Toeplitz matrices
- B. Codenotti, V. Crespi, G. Resta, On the permanent of certain (0,1) Toeplitz matrices, Linear Algebra and its Applications 267 (1997) 65-100.
- (1997) Linear Algebra and Its Applications , vol.267 , pp. 65-100
- Codenotti, B.¹ Crespi, V.² Resta, G.³

4
- 0024132962
- Polytopes, permanents and graphs with large factors
- P. Dagum, M. Luby, M. Mihail, U. Vazirani, Polytopes, permanents and graphs with large factors, Proceedings of the 27th IEEE Symposium on Foundation of Computer Science (1988).
- (1988) Proceedings of the 27th IEEE Symposium on Foundation of Computer Science
- Dagum, P.¹ Luby, M.² Mihail, M.³ Vazirani, U.⁴

5
- 0000452250
- Graphs with circulant adjacency matrices
- B. Elspas, J. Turner, Graphs with circulant adjacency matrices, J. Combinatorial Theory 9 (1970) 297-307.
- (1970) J. Combinatorial Theory , vol.9 , pp. 297-307
- Elspas, B.¹ Turner, J.²

6
- 0026995978
- On the hardness of computing the permanent of random matrices
- U. Feige, C. Lund, On the hardness of computing the permanent of random matrices, in: Proceedings of the 24th ACM Symp. on the Theory of Comput. pp. 643-654, 1992.
- (1992) Proceedings of the 24th ACM Symp. on the Theory of Comput. , pp. 643-654
- Feige, U.¹ Lund, C.²

7
- 0003880505
- Oxford University Press, Oxford
- H. Halberstam, K.F. Roth, Sequences, Oxford University Press, Oxford, 1966.
- (1966) Sequences
- Halberstam, H.¹ Roth, K.F.²

9
- 38249036109
- Permanental compounds and permanents of (0,1) circulants
- H. Minc, Permanental compounds and permanents of (0,1) circulants, Linear Algebra and its Appl. 86 (1987) 11-42.
- (1987) Linear Algebra and Its Appl. , vol.86 , pp. 11-42
- Minc, H.¹

10
- 0004170086
- Wiley, New York
- I. Niven, H.S. Zuckerman, An Introduction to the Theory of Numbers, Wiley, New York, 1980.
- (1980) An Introduction to the Theory of Numbers
- Niven, I.¹ Zuckerman, H.S.²

11
- 0003361098
- Combinatorial mathematics
- H.J. Ryser, Combinatorial mathematics, Carus Mathematical Monograph 14, 1963.
- (1963) Carus Mathematical Monograph , vol.14
- Ryser, H.J.¹

12
- 49249151236
- The complexity of computing the permanent
- L.G. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8 (1979) 189-201.
- (1979) Theoretical Computer Science , vol.8 , pp. 189-201
- Valiant, L.G.¹

13
- 85034715651
- Completeness classes in algebra
- L.G. Valiant, Completeness classes in algebra, ACM Symposium on the Theory of Computer, 1979, pp. 249-261.
- (1979) ACM Symposium on the Theory of Computer , pp. 249-261
- Valiant, L.G.¹

14
- 0024611070
- 3,3-free graphs and related problems
- 3,3-free graphs and related problems, Information and Comput. 80 (1989) 152-164.
- (1989) Information and Comput. , vol.80 , pp. 152-164
- Vazirani, V.V.¹

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