2430 search results - page 203 / 486 » Computing Tutte Polynomials |
136
click to vote
DSN
2006
IEEE
15 years 8 months ago
2006
IEEE
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
109
click to vote
AAECC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
115
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
116
Voted
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
140
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— We give necessary and sufficient conditions, based on the existence of a Lyapunov functional, for the asymptotic stability of a square autonomous 2-D behavior in the sense of ...