2430 search results - page 85 / 486 » Computing Tutte Polynomials |
101
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
118
click to vote
TIM
2010
14 years 9 months ago
2010
Abstract--An approach for the construction of a family of desired order continuous polynomial time window functions is presented without self-convolution of the parent window. The ...
129
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
99
Voted
DIS
1999
Springer
15 years 7 months ago
1999
Springer
: This paper shows that a connectionist law discovery method called RF5X can discover a law in the form of a set of nominally conditioned polynomials, from data containing both nom...
112
Voted
DIS
1998
Springer
15 years 6 months ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...