Sciweavers

526 search results - page 39 / 106
» On circularly symmetric functions
Sort
View
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 8 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
DM
2010
77views more  DM 2010»
13 years 10 months ago
Hall-Littlewood polynomials and fixed point enumeration
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
Brendon Rhoades
JCT
2006
100views more  JCT 2006»
13 years 10 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
COMBINATORICS
1999
100views more  COMBINATORICS 1999»
13 years 9 months ago
Positivity for special cases of (q, t)-Kostka coefficients and standard tableaux statistics
We present two symmetric function operators Hqt 3 and Hqt 4 that have the property Hqt mH(2a1b)(X; q, t) = H(m2a1b)(X; q, t). These operators are generalizations of the analogous ...
Mike Zabrocki
EUROCRYPT
2006
Springer
14 years 1 months ago
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
Frederik Armknecht, Claude Carlet, Philippe Gabori...