Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 323 for “"polynomial time"”.
-
Polynomial-time Martin-Lof type theory
Fragments of extensional Martin-Lof type theory without universes, $ML\sb0,$ are introduced that conservatively extend S. A. Cook and A. Urquhart's $IPV\sp\omega.$ A model for these restricted theories is obtained by interpretation in Feferman's theory APP of operators, a natural model of which is …
-
Fully polynomial time approximation schemes for sequential decision problems
… into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and …
-
Polynomial time optimal algorithm for stencil row planning in e-beam lithography
… 1D row ordering is believed hard as well, and no polynomial time optimal solution has been provided so far. Previous research formulates the problem as the travelling salesman problem, which is NP-hard and solves it by heuristics. In this thesis, we formulate the problem as a matching problem and …
-
Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies
Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given …
-
A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems
In this thesis, we give a pseudo-polynomial time O(log² n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and their positions so that guards located at these points cover the interior of …
-
An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena
… examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.
-
Polynomial Time Algorithms for Transportation and Inventory Management in Serial Supply Chain with Multi-Module Capacitated Vehicles
… in which the total capacity available in each time period is the sum of capacities of a subset of n heterogeneous modules (machines or vehicles). We refer to this class of problems as the Multi-module Capacitated Lot-Sizing Problem without and with Subcontracting, denoted by MCLS and MCLS-S, …
-
Consensus Algorithms for Trees and Strings
… thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of …
-
A Proposed Algorithm Toward Uniform-distribution Monotone DNF Learning
… examples and brought up the problem of whether polynomial-size DNF functions are PAC learnable in polynomial time. It has been about twenty years that the DNF learning problem has been widely regarded as one of the most important ---and challenging --- open questions in Computational Learning …
-
Reconfiguration of Fault-Tolerant VLSI Systems
… reconfiguration problems can be solved in polynomial time while for other related architectures reconfiguration is NP-hard. For those reconfiguration problems that can be solved in polynomial time, we present fast (and in many cases asymptotically optimal) algorithms. For the NP-hard …
-
Computationally Efficient Reinforcement Learning under Partial Observability
… lack provable guarantees, require exponential time, or only apply under stringent assumptions about either the dynamics of the system or the observation model. This thesis shows that the computational intractability of planning and learning in worst-case POMDPs is fundamentally due to …
-
On the best principal submatrix problem
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and \(k \in \{\ 1, \ldots ,n \}\ \). The best principal submatrix problem (BPSM) is: Given matrix \(A\) and constant \(k\), find the biggest assignment problem value from all \(k \times k\) principal …
-
Faster fully polynomial approximation schemes for Knapsack problems
A fully polynomial time approximation scheme (FPTAS) is an algorithm that returns ... -optimal solution to a maximization problem of size n, which runs in polynomial time in both ... We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant …
-
Below P vs NP : fine-grained hardness for big data problems
… problems that are unlikely to be solvable in polynomial time. However, many other important problems do have polynomial-time algorithms, but large exponents in their runtime bounds can make them inefficient in practice. For example, quadratic-time algorithms, although practical on moderately …
-
Edge-packing by isomorphic subgraphs
… graphs, planar graphs and trees). We give polynomial-time algorithms when G is a 2-path or when H is a tree; we show the problem is NP-complete otherwise. Also, we propose straightforward greedy polynomial-time approximation algorithms which are at least 1/|E<sub>G</sub>| optimal.
-
Combinatorial optimization problems with concave costs
… so that the number of resulting pieces is polynomial in the input size of the original problem and linear in 1/c. For several concave cost problems, the resulting piecewise linear problem can be reformulated as a classical combinatorial optimization problem. As a result of our bound, a …
-
Efficient algorithms for bipartite matching problems with preferences
… optimal matchings, and then use this to obtain a polynomial-time algorithm for finding a maximum Pareto optimal matching. The next optimality criterion that we study is the notion of a popular matching. We study popular matchings in CHA and present a polynomial-time algorithm for finding a maximum …
-
High Multiplicity Strip Packing
… rectangle sizes and present an OPT + K - 1 polynomial-time approximation algorithm for it. This beats a previous algorithm with a worst case bound of OPT + K; the time complexity of that algorithm was not known and here we show that it runs in polynomial time.
-
A precise computational approach to knowledge
… computational power (technically defined as polynomial-time computation). In this thesis, we put forward a stronger notion that precisely bounds the knowledge gained by a player in an interaction in terms of the actual computation he has performed (which can be considerably less than any …
-
Valued Constraint Satisfaction Problems over Infinite Domains
… set of PLH cost functions can be solved in polynomial time if the cost functions are improved by fully symmetric fractional operations of all arities. We show this by (polynomial-time many-one) reducing the problem to a finite-domain VCSP which can be solved using a linear programming …
Page 1 of 17