On the Average Sensitivity of Testing Square-Free Numbers-Reference-Cited by-同舟云学术

On the Average Sensitivity of Testing Square-Free Numbers

Published:1999 Issue: Volume: Page:291-299
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bernasconi Anna,Damm Carsten,Shparlinski Igor E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48686-0_29

Reference19 articles.

1. E. Allender, M. Saks and I. E. Shparlinski, 'A lower bound for primality', Proc. 14 IEEE Conf. on Comp. Compl., IEEE, 1999 (to appear).

2. A. Bernasconi, B. Codenotti and J. Simon, 'On the Fourier analysis of Boolean functions', Preprint (1996), 1–24.

3. A. Bernasconi, C. Damm and I. E. Shparlinski, 'Circuit and decision tree complexity of some number theoretic problems', Tech. Report 98-21, Dept. of Math. and Comp. Sci., Univ. of Trier, 1998, 1–17.

4. A. Bernasconi and I. E. Shparlinski, 'Circuit complexity of testing square-free numbers', Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1563 (1999), 47–56.

5. R. B. Boppana, 'The average sensitivity of bounded-depth circuits', Inform. Proc. Letters, 63 (1997), 257–261.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On (Not) Computing the Möbius Function Using Bounded Depth Circuits;Combinatorics, Probability and Computing;2012-08-24

2. On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems;FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science;2001

3. Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key;Lecture Notes in Computer Science;2000