Sciweavers

29908 search results - page 271 / 5982
» On the Complexity of
Sort
View
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
15 years 6 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
15 years 6 months ago
Combinatorial Laplacian of the Matching Complex
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
Xun Dong, Michelle L. Wachs
EOR
2002
68views more  EOR 2002»
15 years 6 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
154
Voted
JC
2002
63views more  JC 2002»
15 years 6 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg
ACRI
2010
Springer
15 years 5 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya