Search for dissertations about: "isomorphism"

Showing result 1 - 5 of 38 swedish dissertations containing the word isomorphism.

2. 1. The Purpose of Evolution : the 'struggle for existence' in the Russian-Jewish press 1860-1900

   Author : Joakim Philipson; Per-Arne Bodin; David Gaunt; Gabriella Safran; Stockholms universitet; []
   Keywords : HUMANIORA; HUMANITIES; HUMANIORA; HUMANITIES; Darwinism; evolution; struggle for existence; reception; Jews; Russia; discourse analysis; isomorphism; integration; slaviska språk; Slavic Languages;

   Abstract : In late 19th century Russia, Darwinism was viewed as a measuring-rod of modernity. Thus, the Jewish reception of Darwinism may serve as an indicator of the extent to which the Jews in Russia were part of the modernization of Russian society. READ MORE

4. 2. Complexity Dichotomies for CSP-related Problems

   Author : Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

   Abstract : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. READ MORE

5. 3. Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference

   Author : Termeh Shafie; Ove Frank; Krzysztof Nowicki; Stockholms universitet; []
   Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; multigraph; vertex labeled graph; edge labeled graph; isomorphism; edge multiplicity; simplicity and complexity; entropy; joint information; information divergence; goodness-of-fit; Statistics; statistik;

   Abstract : This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. READ MORE

6. 4. Isomorphism classes of abelian varieties over finite fields

   Author : Stefano Marseglia; Jonas Bergström; Lars Halle; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algebraic Geometry; Abelian Varieties; Finite Fields; Ideal Class Group; Ideal Class Monoid;

   Abstract : Deligne and Howe described polarized abelian varieties over finite fields in terms of finitely generated free Z-modules satisfying a list of easy to state axioms. In this thesis we address the problem of developing an effective algorithm to compute isomorphism classes of (principally) polarized abelian varieties over a finite field, together with their automorphism groups. READ MORE

7. 5. New Results on Combinatorial Algorithms

   Author : Anders Dessmark; Data Vetenskap; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

   Abstract : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). READ MORE