Subset sum ``cubes and the complexity of primality testing

DOI10.1016/j.tcs.2004.03.037zbMath1098.68050OpenAlexW2036086909MaRDI QIDQ1885040

Alan R. Woods

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.037

zbMATH Keywords

SieveBoolean formulaCircuitCubePrime numberDisjunctive normal formConstant depthSubset sum

Mathematics Subject Classification ID

Related Items (2)

Hilbert cubes in progression-free sets and in the set of squares ⋮ A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on an inequality
• \(\Sigma_ 1^ 1\)-formulae on finite structures
• On divisors of sums of integers. III
• On Hilbert cubes in certain sets
• Exponential lower bounds for depth three Boolean circuits
• The average sensitivity of square-freeness
• PRIMES is in P
• Circuit and decision tree complexity of some number theoretic problems
• On sets of integers containing k elements in arithmetic progression
• Dimension of Projections in Boolean Functions
• On the addition of residue classes mod p
• On the Recognition of Primes by Automata
• An addition theorem modulo p
• A larger sieve
• A lower bound for primality

This page was built for publication: Subset sum ``cubes and the complexity of primality testing