Sciweavers

1368 search results - page 87 / 274
» Generalized Rook Polynomials
Sort
View
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
15 years 10 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
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...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
FCT
2007
Springer
15 years 10 months ago
Path Algorithms on Regular Graphs
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...
Didier Caucal, Dinh Trong Hieu
ECAI
1998
Springer
15 years 8 months ago
On Non-Conservative Plan Modification
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
Paolo Liberatore
ACL
1994
15 years 5 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 4 months ago
On Ritt's decomposition Theorem in the case of finite fields
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
Jaime Gutierrez, David Sevilla