182 search results - page 30 / 37 » The Proof Complexity of Polynomial Identities |
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
ESORICS
2005
Springer
14 years 3 months ago
2005
Springer
Currently, many industrial initiatives focus on web-based applications. In this context an important requirement is that the user should only rely on a standard web browser. Hence...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Existing handover schemes in wireless LANs, 3G/4G networks, and femtocells rely upon protocols involving centralized authentication servers and one or more access points. These ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
RTCSA
2006
IEEE
14 years 3 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...