91 search results - page 5 / 19 » On value sets of polynomials over a field |
142
click to vote
ALENEX
2003
15 years 7 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
169
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
233
click to vote
CC
2010
Springer
15 years 15 days ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
155
click to vote
HPCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
149
click to vote
PKC
2000
Springer
15 years 9 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...