Basic Algorithmic Number Theory

... extremely close to 1). This choice allows shorter and simpler proofs of many facts. In any case, for most computational problems the success probability can be increased by running the algorithm repeatedly, see Section 2.1.4. The success of an algorithm to solve a computational problem is defined wi ...

... extremely close to 1). This choice allows shorter and simpler proofs of many facts. In any case, for most computational problems the success probability can be increased by running the algorithm repeatedly, see Section 2.1.4. The success of an algorithm to solve a computational problem is defined wi ...

Topological modules over strictly minimal topological

... Comment.Math.Univ.Carolinae 44,3 (2003)461–467 ...

... Comment.Math.Univ.Carolinae 44,3 (2003)461–467 ...