Sciweavers

166 search results - page 2 / 34
» Resultants of partially composed polynomials
Sort
View
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 6 months ago
Partial Denominator Bounds for Partial Linear Difference Equations
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynom...
Manuel Kauers, Carsten Schneider
ECSQARU
2009
Springer
14 years 17 days ago
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
Salem Benferhat, Safa Yahi
TIT
2008
121views more  TIT 2008»
13 years 5 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
ARITH
2003
IEEE
13 years 11 months ago
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Jean-Michel Muller
IACR
2011
113views more  IACR 2011»
12 years 5 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup