1383 search results - page 67 / 277 » On the Complexity of the Interlace Polynomial |
163
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
152
click to vote
FSE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
137
click to vote
VLSID
2005
IEEE
16 years 6 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
165
click to vote
EUROPKI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
162
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...