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 264 for “"Polynomial time algorithm"”.
-
On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems
… mainly interested in constructing deterministic polynomial-time algorithms for solving some computational problems that arise in number theory and cryptography. The problems we are interested in include finite field arithmetic, primality testing, and elliptic curve arithmetic. We first present a …
-
Algorithms for recovery in the presence of outliers
… showed that it is possible to do this in polynomial time. This sparked a flurry of work on computational robust statistics. This thesis contributes to this area by studying regression and parameter estimation problems in the presence of outliers. In the context of regression, this thesis …
-
Computational complexity of digraph decomposition and the congruence extension property for algebras
… In 1992, Feigenbaum and Schaffer presented a polynomial-time algorithm to find the unique prime factorization of connected graphs under the strong direct product. In this paper, we show that weakly connected directed graphs have unique prime factorizations with respect to the strong direct …
-
Algorithms for security in robotics and networks
<p>The dissertation presents algorithms for robotics and security. The first chapter gives an overview of the area of visibility-based pursuit-evasion. The following two chapters introduce two specific algorithms in that area. The algorithms are based on research done together with Dr. Giora …
-
Performance enhancement of bus-based parallel/distributed systems
… any buffering delay. Further, we have provided a polynomial time algorithm to optimally reconfigure the bus under the design constraints for any given traffic pattern. We have found that the reconfigured bus substantially outperforms the traditional slotted bus in most practical scenarios. In a …
-
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 …
-
Approximation algorithms for multidimensional bin packing
… has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so that no bin holds …
-
Synchronizable test sequence generation for protocol conformance testing.
… synchronizable test sequence for a given FSM. A polynomial time algorithm is then developed to determine the existence of such a sequence for a given FSM. A duplex digraph method is developed which transforms the order-specified digraph representing an FSM into a duplex digraph. Using the duplex …
-
Algorithms for weighted multidimensional search and perfect phylogeny
… problems in R[superscript]d gives improved algorithms for solving the Lagrangian duals of problems that have both of the following properties. First, in absence of the bad constraints, the problems can be solved in strongly polynomial time by combinatorial algorithms. Second, the number 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.
-
Shortest paths on uncertain terrains
… assumptions (meaning that we do not expect any polynomial time algorithm that finds these paths to be discovered).
-
The complexity of graph polynomials
<p>This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and Sagan (1996) which present new evaluations of the Tutte polynomial concerning orientations. A theorem of Massey et al (1997) gives an expression concerning the average …
-
Robust Learning in High Dimension
… thesis focuses on designing efficient and robust algorithms for learning high-dimensional distributions, particularly in the presence of adversarial corruptions. We addresse existing challenges in robust learning in high dimension and establish new connections between robust statistics and …
-
Isomorphisms in co-TT graphs
… Recognition of these graphs can be done in O(n2) time; however no polynomial-time algorithm to identify isomorphisms between pairs of TT or co-TT graphs was previously known. We give an algorithm to identify these isomorphisms, which takes O(n2) time.
-
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 …
-
Theory of graph traversal edit distance, extensions, and applications
… paradigm beautifully decouples the learning algorithm from the underlying geometric space, which renders graph kernels important for the aforementioned applications. In this paper, we give a new graph kernel which we call graph traversal edit distance (GTED). We introduce the GTED problem and …
-
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 …
-
Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures
… functions to sigma matrices admits a simple polynomial-time algorithm . Finally, we develop a flexible measure of preimage complexity using the aforementioned matrix. This measure naturally partitions all functions on a finite set by characteristics inherent in each function's preimage …
Page 1 of 14