All Questions
2 questions
4
votes
0
answers
311
views
Possible $\mathsf{NP}$ complete problem from number theory
A candidate $\mathsf{NP}$ complete variant of factoring was posted in https://cstheory.stackexchange.com/questions/4769/an-np-complete-variant-of-factoring, where decision problem $\text{BOUNDED-...
- 13.9k
1
vote
0
answers
123
views
Expressing Numbers with a Minimal Sum in Powers of 2 [closed]
The first 64 bits of pi are:
11.00100100001111110110101010001000100001011010001100001000110100
Computer multiplication can be sped up by looking for patterns and ...
- 1,547