Results 1  10
of
145,616
DEMBOWSKIOSTROM POLYNOMIALS FROM DICKSON POLYNOMIALS
"... Motivated by several recent results, we determine precisely when Fk(X d, a) − Fk(0, a) is a DembowskiOstrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or second kind. As a consequence, we obtain a classification of all such polynomials which are also planar; all examples found ..."
Abstract
 Add to MetaCart
Motivated by several recent results, we determine precisely when Fk(X d, a) − Fk(0, a) is a DembowskiOstrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or second kind. As a consequence, we obtain a classification of all such polynomials which are also planar; all examples found
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a q analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order di#erent ..."
Abstract

Cited by 580 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a q analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order di
Cyclic codes and sequences from a class of DembowskiOstrom functions
"... Let q = pn with p be an odd prime. Let 0 ≤ k ≤ n − 1 and k ̸ = n/2. In this paper we determine the value distribution of following exponential(character) sums ∑ and x∈Fq x∈Fq ζ Trn 1 (αxp3k +1 +βx p k +1) p ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let q = pn with p be an odd prime. Let 0 ≤ k ≤ n − 1 and k ̸ = n/2. In this paper we determine the value distribution of following exponential(character) sums ∑ and x∈Fq x∈Fq ζ Trn 1 (αxp3k +1 +βx p k +1) p
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
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
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1311 (54 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
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
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 724 (33 self)
 Add to MetaCart
Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory and Ftheory compactifications on CalabiYau fourfolds. In each case, the hierarchy of scales is fixed by a choice of RR and NS fluxes in the compact manifold. Our solutions involve compactifications of the KlebanovStrassler gravity dual to a confining N = 1 supersymmetric gauge theory, and the hierarchy reflects the small scale of chiral symmetry breaking in the dual gauge theory.
Results 1  10
of
145,616