Results 1  10
of
160,236
Permutation Polynomials Modulo 2
 Finite Fields and Their Applications
, 1999
"... We give an exact characterization of permutation polynomials modulo n = 2 w , w 2: a polynomial P (x) = a 0 + a 1 x + \Delta \Delta \Delta + a d x d with integral coefficients is a permutation polynomial modulo n if and only if a 1 is odd, (a 2 + a 4 + a 6 + \Delta \Delta \Delta) is even, a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give an exact characterization of permutation polynomials modulo n = 2 w , w 2: a polynomial P (x) = a 0 + a 1 x + \Delta \Delta \Delta + a d x d with integral coefficients is a permutation polynomial modulo n if and only if a 1 is odd, (a 2 + a 4 + a 6 + \Delta \Delta \Delta) is even
Permutation Polynomials Modulo 2^w
 Finite Fields and Their Applications
, 1999
"... We give an exact characterization of permutation polynomials modulo n = 2 w , w 2: a polynomial P (x) = a 0 + a 1 x + \Delta \Delta \Delta + a d x d with integral coefficients is a permutation polynomial modulo n if and only if a 1 is odd, (a 2 +a 4 +a 6 + \Delta \Delta \Delta) is even, and (a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We give an exact characterization of permutation polynomials modulo n = 2 w , w 2: a polynomial P (x) = a 0 + a 1 x + \Delta \Delta \Delta + a d x d with integral coefficients is a permutation polynomial modulo n if and only if a 1 is odd, (a 2 +a 4 +a 6 + \Delta \Delta \Delta) is even
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 985 (43 self)
 Add to MetaCart
were considered in the folklore to be contradictory. More generally, we show how to construct a signature scheme with such properties based on the existence of a "clawfree" pair of permutations  a potentially weaker assumption than the intractibility of integer factorization. The new scheme
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract

Cited by 1103 (7 self)
 Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals
, 1999
"... Genomes frequently evolve by reversals �(i, j) that transform a gene order � 1... �i �... i�1 �j�1 �... ..."
Abstract

Cited by 363 (10 self)
 Add to MetaCart
Genomes frequently evolve by reversals �(i, j) that transform a gene order � 1... �i �... i�1 �j�1 �...
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop
The StructureMapping Engine: Algorithm and Examples
 Artificial Intelligence
, 1989
"... This paper describes the StructureMapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structuremapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibili ..."
Abstract

Cited by 512 (115 self)
 Add to MetaCart
, and demonstrate that most of the steps are polynomial, typically bounded by O (N 2 ). Next we demonstrate some examples of its operation taken from our cognitive simulation studies and work in machine learning. Finally, we compare SME to other analogy programs and discuss several areas for future work. This paper
Results 1  10
of
160,236