1418 search results - page 52 / 284 » Schema polynomials and applications |
153
click to vote
JSC
2000
15 years 5 months ago
2000
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
159
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
165
click to vote
WWW
2006
ACM
16 years 6 months ago
2006
ACM
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...
190
click to vote
AUTOMATICA
2011
14 years 9 months ago
2011
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
145
click to vote
TIT
2010
15 years 24 days ago
2010
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...