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
variable filtering conditions across the globe, with respect to tem- perature and precipitation regimes. Therefore, it can be assumed that future filtering conditions will result
Doordat deze groepen van eigenschappen mogelijk ontkoppeld zijn, geeft dit mogelijkheden om belangrijke functies van waterrijke gebieden zoals methaanemissies
From 2016, he was, as a PhD student, awarded a scholarship funded by the CSC-Leiden University joint program to study at the Institute of Environmental Sciences
Trait-based approaches are more powerful to represent plant performances and strategies than traditionally emphasized plant functional types (PFTs) (van Bodegom et al.,