- Author:
- Daniel Shanks
No abstract available.
Cited By
- Bhowmick P and Bhattacharya B (2008). Number-theoretic interpretation and construction of a digital circle, Discrete Applied Mathematics, 156:12, (2381-2399), Online publication date: 20-Jun-2008.
- Meidl W (2019). How Many Bits have to be Changed to Decrease the Linear Complexity?, Designs, Codes and Cryptography, 33:2, (109-122), Online publication date: 1-Sep-2004.
- Caldwell C and Gallot Y (2002). On the primality of n! ± 1 and 2×3×5×...× p±1, Mathematics of Computation, 71:237, (441-448), Online publication date: 1-Jan-2002.
- Koblitz N A family of Jacobians suitable for discrete log cryptosystems Proceedings on Advances in cryptology, (94-99)
Vazirani U Efficiency considerations in using semi-random sources Proceedings of the nineteenth annual ACM symposium on Theory of computing, (160-168)- Blum M How to exchange (secret) keys Proceedings of the fifteenth annual ACM symposium on Theory of computing, (440-447)
- Goldwasser S and Micali S Probabilistic encryption & how to play mental poker keeping secret all partial information Proceedings of the fourteenth annual ACM symposium on Theory of computing, (365-377)
Index Terms
- Solved and unsolved problems in number theory
Recommendations
Concave minimum cost network flow problems solved with a colony of ants
In this work we address the Single-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. This problem is NP-Hard, therefore we propose a hybrid heuristic to solve it. Our goal is not only to apply an ant colony optimization ...
A modified VNS metaheuristic for max-bisection problems
Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033-1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile ...
GRASP for connected dominating set problems
The minimum connected dominating set problem, a variant of the classical minimum dominating set problem, is a very significant NP-hard combinatorial optimization problem with a number of applications. To address this problem, a greedy randomized ...