Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
暂无分享,去创建一个
[1] R. C. Bose,et al. Theorems in the additive theory of numbers , 1962 .
[2] James Turner. Point-symmetric graphs with a prime number of points , 1967 .
[3] Herbert S. Wilf,et al. Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.
[4] J. Gilbert,et al. Graph Coloring Using Eigenvalue Decomposition , 1983 .
[5] N. Biggs. Algebraic Graph Theory: The multiplicative expansion , 1974 .
[6] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[7] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..
[8] Henryk Minc,et al. Permanental compounds and permanents of (0, 1)-circulants , 1987 .
[9] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[10] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[11] YannakakisMihalis,et al. On the hardness of approximating minimization problems , 1994 .
[12] V. Shoup. New algorithms for finding irreducible polynomials over finite fields , 1990 .
[13] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[14] T. Chan. An Optimal Circulant Preconditioner for Toeplitz Systems , 1988 .
[15] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[16] S. D. Cohen. COMPUTATIONAL AND ALGORITHMIC PROBLEMS IN FINITE FIELDS , 1994 .
[17] Michael Doob,et al. Spectra of graphs , 1980 .
[18] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[19] D. Welsh,et al. A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .
[20] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .