- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 11 to 20 of 39 (0.243 seconds)| 11 |
Extremal HypergraphsAsplund, Teo January 2013 (has links)
No description available.
|
| 12 |
Localization of Multiscale Screened Poisson EquationBäck, Viktor January 2012 (has links)
No description available.
|
| 13 |
Legendrian ApproximationsSträngberg, Dan January 2012 (has links)
No description available.
|
| 14 |
Barycentric and harmonic coordinatesLidberg, Petter January 2012 (has links)
No description available.
|
| 15 |
A zero-one law for l-colourable structures with a vectorspace pregeometryAhlman, Ove January 2012 (has links)
No description available.
|
| 16 |
Torsten Brodén och kontinuumhypotesen med en introduktion till naiv mängdläraSkäremo Holmberg, Jonas January 2012 (has links)
No description available.
|
| 17 |
Höjden gånger bredden gånger antal : Gymnasielevers begreppsuppfattnig i gymnasieskolanIvarsson, Emmy, Karlesand, Louise January 2008 (has links)
No description available.
|
| 18 |
Höjden gånger bredden gånger antal : Gymnasielevers begreppsuppfattnig i gymnasieskolanIvarsson, Emmy, Karlesand, Louise January 2008 (has links)
No description available.
|
| 19 |
Decoding algorithms for algebraic geometric codes over ringsBartley, Katherine. January 1900 (has links)
Thesis (Ph.D.)--University of Nebraska-Lincoln, 2006. / Title from title screen (sites viewed on August 10, 2006). PDF text of dissertation: 86 p. ; 0.41Mb. UMI publication number: AAT 3208054. Includes bibliographical references. Also available in microfilm, microfiche and paper format.
|
| 20 |
Elliptiska kurvor och Lenstras faktoriseringsalgoritm / Elliptic Curves and Lenstra's Factorization AlgorithmJonsson, Johan January 2009 (has links)
En elliptisk kurva består av nollställena till ett kubisk polynom i två variabler, sådant att det existerar åtminstone en punkt på kurvan och kurvan är icke-singulär. Punkterna på en sådan kurva bildar en abelsk grupp och olika egenskaper hos dessa grupper beskrivs i den här uppsatsen. Bland annat presenteras Mordell-Weils sats som säger att en elliptisk kurva över en talkropp är en ändligt genererad grupp. Nagell-Lutz sats ger nödvändiga villkor för att en punkt på en rationell elliptisk kurva ska ha ändlig ordning. Resultatet att en elliptisk kurva över de komplexa talen är isomorf med en torus presenteras också. Tillämpningen heltalsfaktorisering presenteras genom en beskrivning av Lenstras algoritm. En implementation av denna algoritm i form av ett datorprogram görs och denna implementation jämförs med den triviala algoritmen för heltalsfaktorisering. / An elliptic curve consists of the zeros of a cubic polynomial i two variables, such that there exists at least one point on the curve and the curve is non-singular. The points on such a curve form an abelian group and various properties of these groups are described in this thesis. Among other things the Mordell-Weil theorem, which states that an elliptic curve over a number field is a finitely generated group, is presented. The Nagell-Lutz theorem gives necessary conditions for a point on a rational elliptic curve to have finite order. Another presented result is that an elliptic curve over the complex numbers is a torus. The application of elliptic curves in integer factorization is presented by describing Lenstra's algorithm. A computer program implementing this algorithm is made and this implementation is compared to the trivial algorithm for integer factorization.
|
Page generated in 0.3916 seconds