Sciweavers

1418 search results - page 64 / 284
» Schema polynomials and applications
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
15 years 6 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
IJNSEC
2010
324views more  IJNSEC 2010»
15 years 28 days ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
EUROCRYPT
2006
Springer
15 years 9 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Intersection Theory for Generic Differential Polynomials and Differential Chow Form
In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension d and order h with a g...
Xiao-Shan Gao, Wei Li, Chun-Ming Yuan
JUCS
2007
88views more  JUCS 2007»
15 years 6 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas