Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
暂无分享,去创建一个
[1] Sharad C. Seth,et al. An Analysis of the Use of Rademacher-Walsh Spectrum in Compact Testing , 1984, IEEE Trans. Computers.
[2] U. Vazirani. Randomness, adversaries and computation (random polynomial time) , 1986 .
[3] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .
[4] Alfred K. Susskind,et al. Testing by Verifying Walsh Coefficients , 1983, IEEE Transactions on Computers.
[5] Claudio Moraga,et al. Spectral Transform Decision Diagrams , 1996 .
[6] J. C. Jackson. The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice , 1996 .
[7] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[8] Suku Nair,et al. An iterative combinational logic synthesis technique using spectral information , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.
[9] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[10] Jehoshua Bruck,et al. Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..
[11] Robert J. Lechner. HARMONIC ANALYSIS OF SWITCHING FUNCTIONS , 1971 .
[12] O. S. Rothaus,et al. On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.
[13] Thyagaraju R. Damarla. Generalized Transforms for Multiple Valued Circuits and Their Fault Detection , 1992, IEEE Trans. Computers.
[14] Benjamin Arazi,et al. Some properties of Hadamard matrices generated recursively by Kronecker products , 1979 .
[15] Alon Orlitsky,et al. A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits , 1990, IEEE Trans. Computers.
[16] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[17] C.R. Edwards. The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis , 1975, IEEE Transactions on Computers.
[18] Jehoshua Bruck,et al. Neural networks, error-correcting codes, and polynomials over the binary n -cube , 1989, IEEE Trans. Inf. Theory.
[19] Richard Beigel,et al. The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[20] Michael Doob,et al. Spectra of graphs , 1980 .
[21] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .