Sökning: "undre gräns"
Visar resultat 1 - 5 av 18 avhandlingar innehållade orden undre gräns.
1. Short Proofs May Be Spacious : Understanding Space in Resolution
Sammanfattning : Om man ser på de bästa nu kända algoritmerna för att avgöra satisfierbarhet hos logiska formler så är de allra flesta baserade på den så kallade DPLL-metoden utökad med klausulinlärning. De två viktigaste gränssättande faktorerna för sådana algoritmer är hur mycket tid och minne de använder, och att förstå sig på detta är därför en fråga som har stor praktisk betydelse. LÄS MER
2. Bayesian methods for sparse and low-rank matrix problems
Sammanfattning : Many scientific and engineering problems require us to process measurements and data in order to extract information. Since we base decisions on information,it is important to design accurate and efficient processing algorithms. This is often done by modeling the signal of interest and the noise in the problem. LÄS MER
3. On Long Proofs of Simple Truths
Sammanfattning : Propositional proof complexity is the study of certificates of infeasibility. In this thesis we consider several proof systems with limited deductive ability and unconditionally show that they require long refutations of the feasibility of certain Boolean formulas. LÄS MER
4. Linear statistics of random matrices and log-gases
Sammanfattning : This thesis is concerned with point processes arising in Random Matrix Theory. It is a compilation thesis: it consists of an introduction and three research papers.In Paper A and Paper B, we study random matrices from the classical compact groups, namely orthogonal, unitary, and symplectic matrices distributed according to Haar measure. LÄS MER
5. Fundamental Estimation and Detection Limits in Linear Non-Gaussian Systems
Sammanfattning : Many methods used for estimation and detection consider only the mean and variance of the involved noise instead of the full noise descriptions. One reason for this is that the mathematics is often considerably simplified this way. LÄS MER