GERELATEERDE DOCUMENTEN
The module isomorphism problem can be formulated as follows: design a deterministic algorithm that, given a ring R and two left R-modules M and N , decides in polynomial time
The handle http://hdl.handle.net/1887/40676 holds various files of this Leiden University dissertation.. Algorithms for finite rings |
Professeur Universiteit Leiden Directeur BELABAS, Karim Professeur Universit´ e de Bordeaux Directeur KRICK, Teresa Professeur Universidad de Buenos Aires Rapporteur TAELMAN,
We are interested in deterministic polynomial-time algorithms that produce ap- proximations of the Jacobson radical of a finite ring and have the additional property that, when run
The handle http://hdl.handle.net/1887/40676 holds various files of this Leiden University
Analyses of strategy use (Fagginger Auer et al., 2013; Hickendorff et al., 2009) showed that from 1997 to 2004, the use of digit-based algorithms for multidigit multiplication
A total of 39 questions were selected from this question- naire (see the Appendix) that were either relevant to the mathematics lessons in general (teacher characteristics,
As for ability level, while the rate of choices for mental strategies did not differ significantly between levels, the accuracy advantage of written compared to mental strategies