The Log of a Privateersman

✍ Collingwood, Harry 📂 Fiction 📅 2007 🏛 BiblioBazaar 🌐 English ⚖ 185 KB

This scarce antiquarian book is a selection from Kessinger PublishingAcentsa -a centss Legacy Reprint Series. Due to its age, it may contain imperfections such as marks, notations, marginalia and flawed pages. Because we believe this work is culturally important, we have made it available as part of

The Log of a Privateersman (1896)

✍ Harry Collingwood 📂 Fiction 📅 1896 🏛 Kessinger Publishing Company 🌐 English ⚖ 185 KB

This scarce antiquarian book is a selection from Kessinger PublishingAcentsa -a centss Legacy Reprint Series. Due to its age, it may contain imperfections such as marks, notations, marginalia and flawed pages. Because we believe this work is culturally important, we have made it available as part of

The Log of Privateersman

✍ Collingwood, Harry 📂 Fiction 📅 0 🌐 English ⚖ 291 KB

A remark on the log-log law

✍ W. L. Steiger 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 156 KB

The Log of a Cowboy [txt]

✍ Andy, Adams, 📂 Fiction 🌐 English ⚖ 163 KB

A Deterministic Construction of Normal B

A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)

✍ Alain Poli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Constructing normal bases of \(G F\left(q^{n}\right)\) over \(G F(q)\) can be done by probabilistic methods as well as deterministic ones. In the following paper we consider only deterministic constructions. As far as we know, the best complexity for probabilistic algorithms is \(O\left(n^{2} \log ^

The Log of a Privateersman

✦ Synopsis