Subset sum ``cubes'' and the complexity of primality testing
type: Item
instance of: scholarly article
title: Subset sum ``cubes'' and the complexity of primality testing
zbMATH Open document ID: 1098.68050
author: Alan R. Woods
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 2111111
zbMATH Keywords: Circuit
zbMATH Keywords: Boolean formula
zbMATH Keywords: Disjunctive normal form
zbMATH Keywords: Constant depth
zbMATH Keywords: Prime number
zbMATH Keywords: Subset sum
zbMATH Keywords: Cube
zbMATH Keywords: Sieve
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.037
OpenAlex ID: W2036086909
cites work: PRIMES is in P
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: A lower bound for primality
cites work: The average sensitivity of square-freeness
cites work: Circuit and decision tree complexity of some number theoretic problems
cites work: On the addition of residue classes mod p
cites work: A larger sieve
cites work: Q3903002
cites work: Q3963072
cites work: Q3856819
cites work: On the Recognition of Primes by Automata
cites work: On Hilbert cubes in certain sets
cites work: Q5786156
cites work: A note on an inequality
cites work: Q5786617
cites work: An addition theorem modulo p
cites work: Exponential lower bounds for depth three Boolean circuits
cites work: Dimension of Projections in Boolean Functions
cites work: On divisors of sums of integers. III
cites work: On sets of integers containing k elements in arithmetic progression
cites work: Q4359314
DOI: 10.1016/J.TCS.2004.03.037
description: scientific article; zbMATH DE number 2111111