Results 1  10
of
4,521
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals
, 1999
"... ..."
A hardcore predicate for all oneway functions
 In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
, 1989
"... Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hardcore” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hardc ..."
Abstract

Cited by 440 (5 self)
 Add to MetaCart
core ” predicates b In this paper we show that every oneof functions (permutations) f, discovered in way function, padded to the form f(p,z) = [Blum Micali $21. Such b ( 5) cannot be effi (P,9(X)), llPl / = 11z//, has bY itself a hardcore ciently guessed (substantially better than SO predicate of the same
of a random permutation matrix
, 2000
"... random matrix theory, characteristic polynomial permutations, central limit theorem We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenva ..."
Abstract
 Add to MetaCart
random matrix theory, characteristic polynomial permutations, central limit theorem We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function
Strengths and weaknesses of quantum computing
, 1996
"... Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both solv ..."
Abstract

Cited by 381 (10 self)
 Add to MetaCart
solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing
Braids, Permutations, Polynomials  I
 Proceedings of the 1 st ACM International Conference on Digital Libraries (DL’96
, 1996
"... Continuing Artin's investigations on representations of braids by permutations, we obtain the following results. The image Im b of a homomorphism b from the Artin braid group B(k) on k strings into symmetric group S(n) of degree n must be a cyclic group whenever either (,) n k 4 or (**) 6 k n 2 ..."
Abstract
 Add to MetaCart
Continuing Artin's investigations on representations of braids by permutations, we obtain the following results. The image Im b of a homomorphism b from the Artin braid group B(k) on k strings into symmetric group S(n) of degree n must be a cyclic group whenever either (,) n k 4 or (**) 6 k n
The Characteristic Polynomial of a Random Permutation Matrix
, 2000
"... We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle. ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle.
A note on constructing permutation polynomials
"... Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for constructing permutation polynomials over the field using a bijective map from H to a coset of H. A similar, but inequivalent, method for lifting permutation behaviour of a polynomial to an extensio ..."
Abstract
 Add to MetaCart
to an extension field is also given. Key words: permutation polynomial, finite field, subfield. Throughout Fq denotes the finite field of characteristic p with q elements (q = pe, e ∈ N), and F∗q the nonzero elements of Fq. Let Fq [X] be the ring of polynomials over Fq in the indeterminate X. A permutation
1A REMARK ON PERMUTABLE POLYNOMIALS
"... In this short note, we show that two theorems of J.Ritt, which are concerned with the composition of polynomials over the field of complex numbers, hold more generally for any algebraically closed field of characteristic zero. Both theorems are heavily used in the theory of permutable polynomials. L ..."
Abstract
 Add to MetaCart
In this short note, we show that two theorems of J.Ritt, which are concerned with the composition of polynomials over the field of complex numbers, hold more generally for any algebraically closed field of characteristic zero. Both theorems are heavily used in the theory of permutable polynomials
Results 1  10
of
4,521