LINA-KULAKOVA.BLOGSPOT.COM

Sage GSoC

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Thursday, 19 July 2012. A polynomial $f in F q[x]$ of degree $n geq 1$ is irreducible if and only if. 1) $x {q n} equiv x mod f$ and. 2) $ gcd (x {q {n/t} -x, f)=1$ for all prime divisors $t$ of $n$. From this fact one can get the Rabin's irreducibility test:.

http://lina-kulakova.blogspot.com/

OVERVIEW OF lina-kulakova.blogspot.com

TRAFFIC RANK

>1,000,000

REVIEWS

0

PAGES IN THIS WEBSITE

11

LINKS TO THIS WEBSITE

CONTACTS

ADDRESSES

SOCIAL LINKS

ONLINE SINCE

WEBSITE DETAILS

SEO

PAGES

SIMILAR SITES

TRAFFIC RANK FOR LINA-KULAKOVA.BLOGSPOT.COM

TODAY'S RATING

>1,000,000

TRAFFIC RANK - AVERAGE PER MONTH

BEST MONTH

March

AVERAGE PER DAY Of THE WEEK

HIGHEST TRAFFIC ON

Tuesday

TRAFFIC BY CITY

Sign up

CUSTOMER REVIEWS

Average Rating: 3.7 out of 5 with 7 reviews

5 star

3

4 star

1

3 star

2

2 star

0

1 star

1

Hey there! Start your review of lina-kulakova.blogspot.com

AVERAGE USER RATING

Write a Review

WEBSITE PREVIEW

LOAD TIME

0.3 seconds

FAVICON PREVIEW

16x16
32x32

CONTACTS AT LINA-KULAKOVA.BLOGSPOT.COM

ADD CONTACT

Login

TO VIEW CONTACTS

Remove Contacts

FOR PRIVACY ISSUES

CONTENT

PAGES IN
THIS WEBSITE

11

SSL

EXTERNAL LINKS

16

SITE IP

172.217.7.1

LOAD TIME

0.308 sec

SCORE

6.2

PAGE TITLE

Sage GSoC | lina-kulakova.blogspot.com Reviews

<META> DESCRIPTION

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Thursday, 19 July 2012. A polynomial $f in F q[x]$ of degree $n geq 1$ is irreducible if and only if. 1) $x {q n} equiv x mod f$ and. 2) $ gcd (x {q {n/t} -x, f)=1$ for all prime divisors $t$ of $n$. From this fact one can get the Rabin's irreducibility test:.

<META> KEYWORDS

1 sage gsoc

2 profiling

3 nmod poly

4 fmpz mod poly

5 else use cz

6 no comments

7 email this

8 blogthis

9 share to twitter

10 share to facebook

CONTENT

Page content here

KEYWORDS ON PAGE

sage gsoc,profiling,nmod poly,fmpz mod poly,else use cz,no comments,email this,blogthis,share to twitter,share to facebook,share to pinterest,irreducibility testing,fact,irreducibility test rabin,input and output,step 1,step 2,step 3,step 4,fact 1,fact 2

SERVER

GSE

CONTENT-TYPE

utf-8

GOOGLE PREVIEW

Sage GSoC | lina-kulakova.blogspot.com Reviews

https://lina-kulakova.blogspot.com

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Thursday, 19 July 2012. A polynomial $f in F q[x]$ of degree $n geq 1$ is irreducible if and only if. 1) $x {q n} equiv x mod f$ and. 2) $ gcd (x {q {n/t} -x, f)=1$ for all prime divisors $t$ of $n$. From this fact one can get the Rabin's irreducibility test:.

INTERNAL PAGES

lina-kulakova.blogspot.com

1

Sage GSoC: August 2012

http://lina-kulakova.blogspot.com/2012_08_01_archive.html

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Subscribe to: Posts (Atom). View my complete profile. Simple template. Template images by gaffera.

2

Sage GSoC: June 2012

http://lina-kulakova.blogspot.com/2012_06_01_archive.html

Sunday, 24 June 2012. I wrote in my previous post that Cantor and Zassenhaus' algorithm of polynomial factorisation over finite fields can be divided into three stages:. In the standard Cantor-Zassenhaus algorithm the squarefree factorisation step is merged with the algorithm itself). According to Modern Computer Algebra, "the second stage consumes the bulk of the computing time". In 1998 Erich Kaltofen and Victor Shoup designed a new approach to distinct-degree factorisation which allows to. Let $l = lc...

3

Sage GSoC: Berlekamp

http://lina-kulakova.blogspot.com/2012/07/berlekamp.html

Monday, 2 July 2012. Yesterday I finished porting Berlekamp's algorithm from nmod poly module to fmpz mod poly factor module. Unlike Cantor-Zassenhaus and Kaltofen-Shoup algorithms this algorithm uses linear algebra - not number theory. Berlekamp algorithm consists of two parts. The first part is standard: squarefree factorization. The second part is more specific. Assume for simplicity that q is an odd prime number. $R = F q[x]/ f $ is. A vector space of dimension $n = deg f$ over. G 2 = gcd(a {(q-1)/2}...

4

Sage GSoC: Adding helper functions, part 1

http://lina-kulakova.blogspot.com/2012/06/adding-helper-functions-part-1.html

Tuesday, 5 June 2012. Adding helper functions, part 1. Now I'm working on the second step of porting code for Cantor-Zassenhaus factorisation. It is necessary to move functions for polynomial arithmetic such as mulmod, remove, pow trunc, pow trunc binexp, powmod ui binexp. For now I moved the first two functions. Posted by Lina Kulakova. Subscribe to: Post Comments (Atom). Adding helper functions, part 1. View my complete profile. Simple template. Template images by gaffera.

5

Sage GSoC: Profiling

http://lina-kulakova.blogspot.com/2012/08/profiling.html

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Subscribe to: Post Comments (Atom). View my complete profile. Simple template. Template images by gaffera.

UPGRADE TO PREMIUM TO VIEW 6 MORE

TOTAL PAGES IN THIS WEBSITE

11

LINKS TO THIS WEBSITE

wiki.mpir.org

FLINT: Fast Library for Number Theory - News

http://wiki.mpir.org/news.html

FLINT: Fast Library for Number Theory. 2016-04-28: The license for FLINT (repository and subsequent releases) is changed to LGPL v2.1 after consultation with our contributors this month. Thanks to everyone involved in the license change. 2015-08-12: FLINT 2.5.2 is released! This fixes a number of build issues for various platforms. 2015-08-12: FLINT 2.5.1 is released! This fixes a number of build issues for various platforms, including OSX and Windows MSVC. 2015-08-07: FLINT 2.5 is released! September 20...

trac.mpir.org

FLINT: Fast Library for Number Theory - News

http://trac.mpir.org/news.html

FLINT: Fast Library for Number Theory. 2016-04-28: The license for FLINT (repository and subsequent releases) is changed to LGPL v2.1 after consultation with our contributors this month. Thanks to everyone involved in the license change. 2015-08-12: FLINT 2.5.2 is released! This fixes a number of build issues for various platforms. 2015-08-12: FLINT 2.5.1 is released! This fixes a number of build issues for various platforms, including OSX and Windows MSVC. 2015-08-07: FLINT 2.5 is released! September 20...

gsoc-sage-lattices.blogspot.com

Lattices in Sage: My Eclipse/PyDev/git workflow for Sage

http://gsoc-sage-lattices.blogspot.com/2012/06/my-eclipsepydevgit-workflow-for-sage.html

Google Summer of Code 2012 project by Jan Pöschko. Monday, June 4, 2012. My Eclipse/PyDev/git workflow for Sage. I want to briefly describe how. I code for Sage so that others can comment on how to improve the workflow or maybe learn something from it. For Python (and actually for all programming languages, meanwhile), I've always been using Eclipse. As an IDE. With PyDev. I have added the complete Sage tree (which is located in /Applications/sage/ on my Mac) as an Eclipse project. As recommended. Which ...

gsoc-sage-lattices.blogspot.com

Lattices in Sage: August 2012

http://gsoc-sage-lattices.blogspot.com/2012_08_01_archive.html

Google Summer of Code 2012 project by Jan Pöschko. Friday, August 24, 2012. Update on class structure, lattice constructors, plotting. Sorry that I haven't posted to this blog for a while. That doesn't mean that nothing happened in the meanwhile—on the contrary, I got quite a lot done in the last weeks of this Summer of Code. First of all, I completely redesigned the class structure for lattices in Sage. Accounting for the discussion on sage-devel. Or via the standard real inner product). Represents latt...

gsoc-sage-lattices.blogspot.com

Lattices in Sage: May 2012

http://gsoc-sage-lattices.blogspot.com/2012_05_01_archive.html

Google Summer of Code 2012 project by Jan Pöschko. Sunday, May 27, 2012. To have everything in one place, I want to add the time schedule from the original project proposal to this blog as well:. Get detailed insights in relevant existing Sage classes and functions. Basic class structure and factory function. Approx. one week of work for exams etc. Extensive testing of the core algorithms. Successive minima, special case for 2-dimensional lattices. 1 week for optional further algorithms. Link href="http:...

gsoc-sage-lattices.blogspot.com

Lattices in Sage: Voronoi cells

http://gsoc-sage-lattices.blogspot.com/2012/07/voronoi-cells.html

Google Summer of Code 2012 project by Jan Pöschko. Sunday, July 8, 2012. Recently, I have implemented the diamond-cutting algorithm to calculate the Voronoi cell of a lattice as described in the paper Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm. By Emanuele Viterbo and Ezio Biglieri. The algorithm considers vectors within a certain distance from the origin. This radius can be specified explicitly to speed things up significantly; if not, a "conservative" safe choice is made.

gsoc-sage-lattices.blogspot.com

Lattices in Sage: Rebasing to Sage 5.2

http://gsoc-sage-lattices.blogspot.com/2012/08/rebasing-to-sage-52.html

Google Summer of Code 2012 project by Jan Pöschko. Thursday, August 16, 2012. Rebasing to Sage 5.2. As there were some changes to Sage since version 5.0 that also affect my code, I rebased my code from Sage 5.0 to 5.2. That meant installing the latest version, cloning a new branch "lattices", and manually copying over the lattices files and re-doing respective changes to some global files. I retained the 5.0-compatible version as a separate branch. Whereas the main branch on github. Posted by Jan Pöschko.

gsoc-sage-lattices.blogspot.com

Lattices in Sage: Update on class structure, lattice constructors, plotting

http://gsoc-sage-lattices.blogspot.com/2012/08/update-on-class-structure-lattice.html

Google Summer of Code 2012 project by Jan Pöschko. Friday, August 24, 2012. Update on class structure, lattice constructors, plotting. Sorry that I haven't posted to this blog for a while. That doesn't mean that nothing happened in the meanwhile—on the contrary, I got quite a lot done in the last weeks of this Summer of Code. First of all, I completely redesigned the class structure for lattices in Sage. Accounting for the discussion on sage-devel. Or via the standard real inner product). Represents latt...

gsoc-sage-lattices.blogspot.com

Lattices in Sage: July 2012

http://gsoc-sage-lattices.blogspot.com/2012_07_01_archive.html

Google Summer of Code 2012 project by Jan Pöschko. Sunday, July 8, 2012. Recently, I have implemented the diamond-cutting algorithm to calculate the Voronoi cell of a lattice as described in the paper Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm. By Emanuele Viterbo and Ezio Biglieri. The algorithm considers vectors within a certain distance from the origin. This radius can be specified explicitly to speed things up significantly; if not, a "conservative" safe choice is made.

UPGRADE TO PREMIUM TO VIEW 7 MORE

TOTAL LINKS TO THIS WEBSITE

16

OTHER SITES

lina-kotsit.deviantart.com

Lina-Kotsit (Лина &hearts;) - DeviantArt

Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) " class="mi". Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ". Join DeviantArt for FREE. Forgot Password or Username? 1051;ина ♥. Deviant for 3 Years. This deviant's full pageview. 1051;ина ♥. December 17, 1992. Last Visit: 6 days ago. This is the place where you can personalize your profile! You can drag and drop to rearrange.

lina-kr.skyrock.com

lina-kr's blog - Blog de lina-kr - Skyrock.com

28/03/2010 at 6:02 AM. 31/03/2010 at 7:54 AM. Subscribe to my blog! Don't forget that insults, racism, etc. are forbidden by Skyrock's 'General Terms of Use' and that you can be identified by your IP address (66.160.134.3) if someone makes a complaint. Please enter the sequence of characters in the field below. Posted on Wednesday, 31 March 2010 at 7:18 AM. Please enter the sequence of characters in the field below. Posted on Wednesday, 31 March 2010 at 7:16 AM. Welcome to my blog. Please enter the seque...

lina-kriba59800.skyrock.com

lina-kriba59800's blog - linou59800 - Skyrock.com

02/08/2011 at 11:02 AM. 02/08/2011 at 12:06 PM. Subscribe to my blog! Tro belle c beau. Don't forget that insults, racism, etc. are forbidden by Skyrock's 'General Terms of Use' and that you can be identified by your IP address (66.160.134.11) if someone makes a complaint. Please enter the sequence of characters in the field below. Posted on Tuesday, 02 August 2011 at 12:06 PM. Coucou tou le monde devener mes fan silvouplet et je deviendrai les votre 8-p. Posted on Tuesday, 02 August 2011 at 11:11 AM.

lina-kristin.de

lina-kristin.de | Triathletin, Radsportlerin

Ironman Zürich 2015- mein drittes Finish bei einem Langdistanz Rennen in der Profikategorie Pleiten, Pech und Happy End. Trotz diversen Ups and Downs, geprägt von sowohl mentalen als auch körperlichen Schwächen, habe ich es geschafft, meine erste Langdistanz dieses Jahr mit einer zwar unerwartet schlechten Endzeit, jedoch mit einer guten Platzierung, zu finishen! Kein gutes Gefühl, denn es wurde immer heisser. „Kopf hoch, Lina, Shit happens, weiter“ habe ich mir zugeredet und bin weiter g...Und das, obwo...

lina-ks.com

J+B Projekt GmbH

Hier entsteht in Kürze eine neue Webpräsenz! Bitte haben Sie etwas Geduld und schauen Sie demnächst mal wieder vorbei.

lina-kulakova.blogspot.com

Sage GSoC

Monday, 6 August 2012. I tried to make a simple formula which fits these data. Finally, I got:. If bits 5 and n 128, then use B,. Else if bits = 5 and 2 * bits n 74, then use KS. If 5 * bits n 75, then use KS, else use CZ. Posted by Lina Kulakova. Thursday, 19 July 2012. A polynomial $f in F q[x]$ of degree $n geq 1$ is irreducible if and only if. 1) $x {q n} equiv x mod f$ and. 2) $ gcd (x {q {n/t} -x, f)=1$ for all prime divisors $t$ of $n$. From this fact one can get the Rabin's irreducibility test:.

lina-kun.deviantart.com

Lina-kun (Celina Poole) | DeviantArt

Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')". Deviant for 12 Years. This deviant's full pageview. Last Visit: 505 weeks ago. This is the place where you can personalize your profile! By moving, adding and personalizing widgets. You can drag and drop to rearrange. You can edit widgets to customize them. The bottom has widgets you can add! Some widgets you can only access when you get Core Membership.

lina-kun5.deviantart.com

Lina-kun5 (>.< Who am I...?) - DeviantArt

Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')" class="mi". Window.devicePixelRatio*screen.width 'x' window.devicePixelRatio*screen.height) :(screen.width 'x' screen.height) ; this.removeAttribute('onclick')". Join DeviantArt for FREE. Forgot Password or Username? Deviant for 9 Years. This deviant's full pageview. Last Visit: 5 weeks ago. This is the place where you can personalize your profile! They stay...

lina-l-s.skyrock.com

Lina-L-S's blog - Blog de Lina-L-S - Skyrock.com

More options ▼. Subscribe to my blog. Created: 09/07/2014 at 8:47 PM. Updated: 13/07/2014 at 7:46 PM. The story of my life . Don't forget that insults, racism, etc. are forbidden by Skyrock's 'General Terms of Use' and that you can be identified by your IP address (66.160.134.14) if someone makes a complaint. Please enter the sequence of characters in the field below. Posted on Sunday, 13 July 2014 at 7:46 PM. The story of my life . Un jour, il commença a lui parler sur les. Sun, July 13, 2014.

lina-l.skyrock.com

Blog de Lina-L - LinaL. - Skyrock.com

Mot de passe :. J'ai oublié mon mot de passe. Plus d'actions ▼. S'abonner à mon blog. Création : 13/01/2013 à 08:02. Mise à jour : 17/01/2014 à 14:53. L'auteur de ce blog n'accepte que les commentaires de ses amis. Tu n'es pas identifié. Clique ici pour poster un commentaire en étant identifié avec ton compte Skyrock. Et un lien vers ton blog ainsi que ta photo seront automatiquement ajoutés à ton commentaire. Posté le vendredi 17 janvier 2014 14:53. Tu n'es pas identifié. Quand on aime, on ne compte pas.

lina-l0ve-x3.skyrock.com

Blog Music de Lina-L0ve-x3 - ~ « Je t'avais oublié, tu sais. Puis tu es revenu avec tes grands sourires... Et comme une conne,... - Skyrock.com

Mot de passe :. J'ai oublié mon mot de passe. Je t'avais oublié, tu sais. Puis tu es revenu avec tes grands sourires. Et comme une conne, j'ai rechuté. Autre / Non spécifié. Allah , le grand maître de l'univers ( L ) . Mise à jour :. Abonne-toi à mon blog! REJOINT MOI ICI MAINTENENT. Le blog de liebe-r0ck-x3. Via : liebe-r0ck-x3.skyblog.com. Posté le samedi 11 juin 2011 10:51. Poster sur mon blog.