Non-deterministic Polynomial Time
Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring
... in polynomial time? It is well-known that there is a probabilistic polynomial time algo- rithm that on input (N, e, d) outputs the factors p and ...first deterministic polynomial ...
10
On Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring
... ) time with success probability almost equal to ...a deterministic polynomial time ...based deterministic poly(log N ) time algorithm that uses both d p , d q (in addition to the ...
8
A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes
... "yes.") deterministic polynomial-time solution to any of them would also be a deterministic polynomial-time solution to every other problem in ...a polynomial- ...
6
Quantum Computers Can Find Quadratic Nonresidues in Deterministic Polynomial Time. Thomas G. Draper
... Abstract—An integer a is a quadratic nonresidue for a prime p if x 2 ≡ a mod p has no solution. Quadratic nonresidues may be found by probabilistic methods in polynomial time. However, without assuming the ...
7
Schemes for Deterministic Polynomial Factoring
... • It is not only a fundamental problem but also has practical applications: coding theory, integer factoring algorithms, computer algebra, ... • Berlekamp (1967) showed that the problem reduces in deterministic ...
83
Deterministic polynomial factoring and association schemes
... given polynomial over a finite field. There exist various randomized polynomial time algorithms for this problem, such as Berlekamp [6], Rabin [41], Cantor and Zassenhaus [12], von zur Gathen and ...
18
P schemes and Deterministic Polynomial Factoring Over Finite Fields
... that polynomial factoring over finite fields can be solved in deterministic polynomial time under GRH if an irreducible lifted polynomial with a special Galois group is ...
292
Polynomial-time equivalence testing for deterministic fresh-register automata
... end, polynomial space is needed to keep track of the current content of both sets of ...from non-emptiness of deterministic linear-bounded Turing ...
15
Evaluating the Effectiveness of Mutation Operators on the Behavior of Genetic Algorithms Applied to Non-deterministic Polynomial Problems
... improved GA to solve TSP through adopting an untwist operator which can unite the knots of route effectively, so it can shorten the length of route and quicken the convergent speed. In [6], a new selection strategy is ...
6
A Polynomial Time Dynamic Oracle for Non Projective Dependency Parsing
... ` ∗ , to represent computations. 2.2 Configuration Loss and Dynamic Oracles A transition-based dependency parser is a non- deterministic device, meaning that a given con- figuration can be mapped into ...
11
Non-Malleable Codes Against Bounded Polynomial Time Tampering
... of non-malleable codes, encode/decode can be in a larger complexity class than the adversary, and so standard non-interactive NMCom is an ...Quasi Non-Malleable Commitments in which the adversary ...
30
Extensibility of Association Schemes and GRH-Based Deterministic Polynomial Factoring
... in time d O(t) if the scheme X is extensible to height ...running time of the association scheme extension algorithm is polynomial in the order of ...all non-Schurian association schemes up to ...
119
Non-deterministic graph searching in trees
... Note that at each execution of the while-loop (Line 5) of the protocol, either at least one vertex is cleared, or one searcher becomes free. Therefore, there are at most n 2 executions of this loop. Moreover, each ...
32
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
... 1.2.2 The white-box case In the white-box case things are trickier. We first explain why we cannot adopt the same strategy as in the black-box case. The natural thing would be to try and compute the circuit guaranteed by ...
25
DETERMINISTIC POLYNOMIAL FACTORING AND ASSOCIATION SCHEMES
... n/2 r ). Thus, for r = O(1) our algorithm is polynomial time. Further, for r = Ω(log log n) there are infinitely many prime degrees n for which our algorithm is applicable and better than the best known; ...
20
Multiverse Debugging: Non-deterministic Debugging for Non-deterministic Programs
... a deterministic message ...a deterministic pattern would create a deterministic message order, traditional concurrent debuggers only keep track of one ...possible non-deterministic ...
32
Deterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
... • Non-deterministic finite automata (NFA) – Machine now can “choose” it’s path.. – Each transition takes you from a state to a set of states.[r] ...
Training Deterministic Parsers with Non Deterministic Oracles
... [email protected] Abstract Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are ...
12
Practical Polynomial Factoring in Polynomial Time
... These timings show that our algorithm, a simplification of the r-cubed algorithm of [17], can be comparable in practice to [8] on benchmark polynomials (and in most of the cases a bit faster). Also of interest are the ...
8
Practical polynomial factoring in polynomial time
... the time. For a proven polynomial time complexity bound this heuristic must always decide to compute more data when the level of p-adic precision is large enough (see section 4 for more ...
7