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 72 for “"Polynomial time algorithm"”.
-
Efficient algorithms for bipartite matching problems with preferences
… and hospitals). We present a range of efficient algorithms for finding various types of optimal matchings in the context of these problems. Our optimality criteria involve a diverse range of concepts that are alternatives to classical stability. Examples include so-called popular and Pareto …
-
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.
-
Reliability and energy-efficiency in wireless ad-hoc networks
… and analyzed both optimal and heuristic algorithms that find minimum energy node and link disjoint paths in a wireless ad hoc network. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a …
-
Computing the trace of an endomorphism of a supersingular elliptic curve
We provide an explicit algorithm for computing the trace of an endomorphism of an elliptic curve which is given by a chain of small-degree isogenies. We analyze its complexity, determining that if the length of the chain, the degree of the isogenies, and the log of the field-size are all O(n), the …
-
Public key cryptography and the zero-one knapsack problem
… zero-one knapsack problem are rejected as too time-consuming. Herlestam's proposed attack is discussed in detail. The results of theoretical examination and computer tests show that it is not quick, as claimed. The recent polynomial time algorithm of A. Shamir solving most instances of the …
-
Computationally Efficient Reinforcement Learning under Partial Observability
… is computationally intractable. Most existing algorithms either 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 …
-
Optimal estimation in high-dimensional and nonparametric models
… this rate cannot be attained by any (randomised) polynomial-time algorithm under a computational complexity assumption. The trade-off between computational efficiency and statistical optimality is discussed throughout the thesis. For estimating the volume of a set from the class of convex or …
-
Deterministic Circuit Range Avoidance is (Likely) Intractable
… does there exist an efficient deterministic algorithm for Avoid? We give the first evidence that deterministically solving Avoid is intractable. We show that there is no polynomial-time algorithm for Avoid under plausible assumptions in complexity theory and cryptography. Specifically, our …
-
Design, analysis and reconfiguration of defect-tolerant VLSI and parallel processor arrays
… graph problem, and a provably average-case polynomial time algorithm is presented, while all previous memory reconfiguration algorithms were given without an average-case time complexity analysis. The implemented algorithm runs faster than existing heuristics when the problem size is large. …
-
Computing the Zeta Function of Two Classes of Singular Curves
… present, assuming the characteristic is fixed, a polynomial-time algorithm which computes the zeta function the curve, and we provide the results of an implementation in MAGMA. The case of singular superelliptic curves extends a method of Gaudry and Gurel, and the case of nodal projective curves …
-
Learning Algorithms for Mixtures of Linear Dynamical Systems: A Practical Approach
… work, we give the first implementation of an algorithm to learn a mixture of linear dynamical systems (LDS’s), and an analysis of algorithms to learn a single linear dynamical system. Following the work of Bakshi et al. ([1]), we implement a recent polynomial-time algorithm based on a tensor …
-
Topics in computational learning theory and graph algorithms
… been shown that the existence of an Occam algorithm for a class of concepts is a sufficient condition for the PAC-learnability of that class. (An Occam algorithm is a randomized polynomial-time algorithm that, when given as input a sample of strings of some unknown concept to be learned, …
-
Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem
… structure of the problem. In this research, a polynomial-time algorithm is proposed to approximately obtain a near optimal solution for the robust KP with a provable quality. The quality is described by an error term and it is derived for the proposed algorithm. It is shown that the error …
-
PERFORMANCE ESTIMATION AND SCHEDULING FOR PARALLEL PROGRAMS WITH CRITICAL SECTIONS
… We derived formulas to estimate the average time spent in a critical section in presence of synchronization barrier and in absence of it. We also develop and establish the optimality of a fast polynomial-time algorithm to find a schedule with the shortest makespan for any number of threads …
-
Cuts and connectivity in graphs and hypergraphs
… are the following: - We introduce a faster algorithm for finding the reduced graph in element-connectivity computations. We also show its application to node separation. - We present several results on hypergraph cuts, including (a) a near linear time algorithm for finding a …
-
Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic
… way. The commit phase works on one variable at a time and transitions values from temporary to permanent whenever possible. We viewed tri-state logic as a hyperspace above the binary (Boolean) logic. The second improvement is algorithmic. We modified the semantics of the classic 3 Conjunctive …
-
Stable Phase Retrieval Using Low-Redundancy Frames of Polynomials
… − 3 magnitude measurements that admits a stable polynomial time algorithm to recover the signal under the influence of noise. We also explore the behavior of pathological signals in this algorithm, as well as the mean squared error. Finally, we show that if the signal is known to be s sparse, …
-
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 …
-
René Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field
… integer area with rational sides. In more recent times the deep mathematics of elliptic curves was used by Andrew Wiles et. al., to construct a proof of Fermat's last theorem, a problem which challenged mathematicians for more than 300 years. In addition, elliptic curves over finite fields find …
-
PROBLEMI DI CLUSTERING CON VINCOLI: ALGORITMI E COMPLESSITÀ
… Ak . As a consequence, we determine an efficient algorithm for bi-clustering (if p is an integer); however, we show that the general problem is NP-complete, while a relaxed version of it admits a polynomial-time algorithm. When p is not an integer, we prove that the problem of deciding if the …
Page 1 of 4