Sciweavers

1004 search results - page 5 / 201
» Product representations of polynomials
Sort
View
EJC
2010
13 years 6 months ago
Discrete piecewise linear functions
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions t...
Sergei Ovchinnikov
JC
2006
105views more  JC 2006»
13 years 6 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
ORL
2010
98views more  ORL 2010»
13 years 5 months ago
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for a...
Hayato Waki, Masakazu Muramatsu
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
13 years 10 months ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...
FSTTCS
2001
Springer
13 years 11 months ago
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
Erion Plaku, Igor Shparlinski