The following pages link to Paul A. Pritchard (Q1055462):
Displaying 23 items.
- (Q287108) (redirect page) (← links)
- An old sub-quadratic algorithm for finding extremal sets (Q287109) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- Fast association discovery in derivative transaction collections (Q698709) (← links)
- Opportunistic algorithms for eliminating supersets (Q758205) (← links)
- A case study of number-theoretic computation: Searching for primes in arithmetic progression (Q1055463) (← links)
- Linear prime-number sieves: A family tree (Q1092658) (← links)
- Another look at the ''longest ascending subsequence'' problem (Q1154283) (← links)
- Explaining the wheel sieve (Q1160644) (← links)
- Algorithms for finding matrix models of propositional calculi (Q1181707) (← links)
- A proof rule for multiple coroutine systems (Q1225452) (← links)
- (Q3015227) (← links)
- Fast compact prime number sieves (among others) (Q3337529) (← links)
- Eighteen Primes in Arithmetic Progression (Q3671240) (← links)
- Long Arithmetic Progressions of Primes: Some Old, Some New (Q3691731) (← links)
- Some negative results concerning prime number generators (Q3717107) (← links)
- (Q3865424) (← links)
- A sublinear additive sieve for finding prime number (Q3902523) (← links)
- (Q4138081) (← links)
- Metaphysics Δ 15 and Pre-Euclidean Mathematics (Q4532023) (← links)
- Twenty-Two Primes in Arithmetic Progression (Q4846183) (← links)
- (Q4847940) (← links)
- On Computing the Subset Graph of a Collection of Sets (Q4935305) (← links)
