Search for dissertations about: "computational complexity"
Showing result 16 - 20 of 524 swedish dissertations containing the words computational complexity.
-
16. Simulation of Electro-Optic Modulators by a Time-Domain Beam-Propagation Method
Abstract : Electro-optic modulators (EOMs) are components which convert electric signals to optical ones. They are needed, e.g., at the transmitter end of fiber-optic communication systems and in time-stretch analog-to-digital converters. READ MORE
-
17. Computational Modeling of Reaction and Diffusion Processes in Mammalian Cell
Abstract : PAHs are the reactive toxic chemical compounds which are present as environmental pollutants. These reactive compounds not only diffuse through the membranes of the cell but also partition into the membranes. They react with the DNA of the cell giving rise to toxicity and may cause cancer. READ MORE
-
18. Complexity Dichotomies for CSP-related Problems
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
-
19. Convergence Acceleration for Flow Problems
Abstract : Convergence acceleration techniques for the iterative solution of system of equations arising in the discretisations of compressible flow problems governed by the steady state Euler or Navier-Stokes equations is considered. The system of PDE is discretised using a finite difference or finite volume method yielding a large sparse system of equations. READ MORE
-
20. Complexity and Error Analysis of Numerical Methods for Wireless Channels, SDE, Random Variables and Quantum Mechanics
Abstract : This thesis consists of the four papers which consider different aspects of stochastic process modeling, error analysis, and minimization of computational cost. In Paper I, we construct a Multipath Fading Channel (MFC) model for wireless channels with noise introduced through scatterers flipping on and off. READ MORE