Subset sum ``cubes'' and the complexity of primality testing (Q1885040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subset sum ``cubes and the complexity of primality testing |
scientific article; zbMATH DE number 2111111
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subset sum ``cubes'' and the complexity of primality testing |
scientific article; zbMATH DE number 2111111 |
Statements
Subset sum ``cubes'' and the complexity of primality testing (English)
0 references
27 October 2004
0 references
Circuit
0 references
Boolean formula
0 references
Disjunctive normal form
0 references
Constant depth
0 references
Prime number
0 references
Subset sum
0 references
Cube
0 references
Sieve
0 references
