1![An algorithm for realizing Euclidean distance matrices Jorge Alencar 1 Instituto Federal de Educa¸c˜ ao, Ciˆencia e Tecnologia do Sul de Minas Gerais, Inconfidentes, MG, Brazil An algorithm for realizing Euclidean distance matrices Jorge Alencar 1 Instituto Federal de Educa¸c˜ ao, Ciˆencia e Tecnologia do Sul de Minas Gerais, Inconfidentes, MG, Brazil](https://www.pdfsearch.io/img/2a7b4d98f0e9759a627cc96c5eb4820a.jpg) | Add to Reading ListSource URL: www.lix.polytechnique.frLanguage: English - Date: 2015-07-30 06:05:21
|
---|
2![A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes](https://www.pdfsearch.io/img/7548b5c684bfb2854b6a7c5ea7dfa926.jpg) | Add to Reading ListSource URL: perso.ens-lyon.frLanguage: English - Date: 2010-11-22 05:03:50
|
---|
3![THE EUCLIDEAN ALGORITHM IN ALGEBRAIC NUMBER FIELDS FRANZ LEMMERMEYER Abstract. This article, which is an update of a version published 1995 in Expo. Math., intends to survey what is known about Euclidean number fields; THE EUCLIDEAN ALGORITHM IN ALGEBRAIC NUMBER FIELDS FRANZ LEMMERMEYER Abstract. This article, which is an update of a version published 1995 in Expo. Math., intends to survey what is known about Euclidean number fields;](https://www.pdfsearch.io/img/5bf62801c193399f475f54bc80aa65c2.jpg) | Add to Reading ListSource URL: www.rzuser.uni-heidelberg.deLanguage: English - Date: 2010-08-16 16:00:09
|
---|
4![Notes on continued fractions 1. Chapter 49: The Topsy-turvy world of continued fractions First, let’s go back, way back, to the Euclidean algorithm. Let’s say for 23 and 5. If we run this through we get 23 = 4 ∗ 5 Notes on continued fractions 1. Chapter 49: The Topsy-turvy world of continued fractions First, let’s go back, way back, to the Euclidean algorithm. Let’s say for 23 and 5. If we run this through we get 23 = 4 ∗ 5](https://www.pdfsearch.io/img/8af1d38b56b66f6ba10a5fd3c80c8f3d.jpg) | Add to Reading ListSource URL: alpha.math.uga.edu- Date: 2015-04-20 12:50:21
|
---|
5![Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1 Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1](https://www.pdfsearch.io/img/5a0900aed9fcf7778ecd217ba830d889.jpg) | Add to Reading ListSource URL: robertmarks.org- Date: 2012-04-06 23:07:00
|
---|
6![Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2 Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2](https://www.pdfsearch.io/img/820acc69adee714702e599ff577bd052.jpg) | Add to Reading ListSource URL: www-cc.cs.uni-saarland.deLanguage: English - Date: 2015-03-26 10:03:27
|
---|
7![SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of](https://www.pdfsearch.io/img/7dc121e9c81405f2324aec29df809b4a.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2007-11-23 17:17:47
|
---|
8![Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1](https://www.pdfsearch.io/img/df659750d7f73d539655c7d628103700.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2016-01-03 06:48:33
|
---|
9![Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces ¨ ¨ Jens Jagersk Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces ¨ ¨ Jens Jagersk](https://www.pdfsearch.io/img/0cb11eb01d44002dee5f091f0830f857.jpg) | Add to Reading ListSource URL: ls2-www.cs.uni-dortmund.deLanguage: English - Date: 2008-07-29 04:35:38
|
---|
10![Optimal strategies for maintaining a chain of relays between an explorer and a base camp Optimal strategies for maintaining a chain of relays between an explorer and a base camp](https://www.pdfsearch.io/img/3b1408ea10cf99f48afc0250e5828591.jpg) | Add to Reading ListSource URL: www.dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:56
|
---|