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 1226 for “"Polynomial time"”.

  1. Polynomial Time Calculi

    … deals with type systems which guarantee polynomial time complexity of typed programs. Such algorithms are commonly regarded as being feasible for practical applications, because their runtime grows reasonably fast for bigger inputs. The implicit complexity community has proposed several …

    lmu-germany Repository record for Polynomial Time Calculi (opens in a new tab)

  2. 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 …

    uiuc Repository record for Polynomial-time Martin-Lof type theory (opens in a new tab)

  3. Parameterized complexity and polynomial-time approximation schemes

    … This excludes the possibility of solving them in polynomial time unless P=NP. A number of approaches have been proposed in dealing with NPhard problems, among them are approximation algorithms and parameterized algorithms. The study of approximation algorithms tries to find good enough solutions …

    tamu Repository record for Parameterized complexity and polynomial-time approximation schemes (opens in a new tab)

  4. Isogeny Based Cryptosystems and a Polynomial-Time Break

    The development of quantum computing poses a significant challenge to many widely deployed public key cryptographic systems, motivating the search for quantum-resistant alternatives. Among the proposed ap-proaches, isogeny-based cryptography attracted considerable attention due to its strong …

    calgary Repository record for Isogeny Based Cryptosystems and a Polynomial-Time Break (opens in a new tab)

  5. A New Perspective on a Polynomial Time Knot Polynomial

    In this work we consider the Z1(K) polynomial time knot polynomial defined anddescribed by Dror Bar-Natan and Roland van der Veen in their 2018 paper ”A polynomial time knot polynomial”. We first look at some of the basic properties of Z1(K), and develop an invariant of diagrams Ψm(D) related to …

    lsu-thes Repository record for A New Perspective on a Polynomial Time Knot Polynomial (opens in a new tab)

  6. Polynomial time and private learning of unbounded Gaussian Mixture Models

    … small overhead in sample complexity and running time. As the main application of our framework, we develop an algorithm for privately learning mixtures of Gaussians using the non-private algorithm of Moitra and Valiant [MV10] as a BlackBox and incurs only a polynomial time overhead in the sample …

    mcmaster Repository record for Polynomial time and private learning of unbounded Gaussian Mixture Models (opens in a new tab)

  7. Primality Testing is Polynomial-time: A Mechanised Verification of the AKS Algorithm

    … (AKS) algorithm, a deterministic polynomial-time primality test. This algorithm was first announced by the AKS team in 2002, later improved in 2004. Our work is based on the improved version, with Parts 1 and 2 aim at a formal proof of the correctness of the algorithm, and Part 3 …

    anu Repository record for Primality Testing is Polynomial-time: A Mechanised Verification of the AKS Algorithm (opens in a new tab)

  8. On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence

    … properties of interior-point methods with proven polynomial iteration complexity. Our focus is on linear programming and semidefinite programming special cases. We provide a survey on polynomial iteration complexity interior-point methods which also achieve asymptotic superlinear convergence. We …

    waterloo Repository record for On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence (opens in a new tab)

  9. 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 …

    uiuc Repository record for Polynomial time optimal algorithm for stencil row planning in e-beam lithography (opens in a new tab)

  10. A Polynomial Time Procedure Converting Error Correcting Codes to Semantically Secure Wiretap Codes

    … channel. This conversion is shown to be polynomial time efficient with block length and is applicable to any discrete time channel. To prove the induced wiretap code is semantically secure, we have upgraded recent leakage bounds by maximizing over all message distributions. The semantic …

    ndsu Repository record for A Polynomial Time Procedure Converting Error Correcting Codes to Semantically Secure Wiretap Codes (opens in a new tab)

  11. Improvement and partial simulation of King & Saia’s expected-polynomial-time Byzantine agreement algorithm

    … of King and Saia 2016’s expected polyno- mial time byzantine agreement algorithm, which which greatly speeds up Bracha’s Byzantine agreement algorithm by introducing a shared coin flip subroutine and a method for detecting adversarially controlled nodes. In addition to implementing the …

    uvic Repository record for Improvement and partial simulation of King & Saia’s expected-polynomial-time Byzantine agreement algorithm (opens in a new tab)

  12. 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 …

    qucosa-diss

  13. 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.

    byu Repository record for An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena (opens in a new tab) Download PDF for An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena (opens in a new tab)

  14. An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography

    … problems that are not believed to be solvable in polynomial-time. Some of the most popular problems they have found are the Discrete Logarithm Problem and Integer Factoring. The former is used in Diffie-Hellman Key Exachange (DHK) and El Gamal encryption, while the latter is used in RSA. El Gamal …

    tamu Repository record for An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography (opens in a new tab)

Page 1 of 62