On the average sensitivity of testing square-free numbers.

DOI10.1007/3-540-48686-0_29MaRDI QIDQ4938669zbMATH OpenOpenAlexFDO

Authors A. Bernasconi, Carsten Damm, Igor E. Shparlinski

Publication date 3 April 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48686-0_29

Mathematics Subject Classification ID

Boolean functions (06E30) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• The average sensitivity of square-freeness
• Complexity of some arithmetic problems for binary polynomials
• Circuit and decision tree complexity of some number theoretic problems
• On polynomial representations of Boolean functions related to some number theoretic problems
• The average sensitivity of bounded-depth formulas

Cited in

(5)

• The average sensitivity of square-freeness
• Circuit and decision tree complexity of some number theoretic problems
• Complexity of some arithmetic problems for binary polynomials
• Communication complexity of some number theoretic functions
• A lower bound for primality

This page was built for publication: On the average sensitivity of testing square-free numbers.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938669)