7796 search results - page 114 / 1560 » On Generalized Schur Numbers |
111
Voted
ADCM
1998
15 years 14 days ago
1998
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
114
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
70
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of s...
123
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
ARSCOM
2005
15 years 20 days ago
2005
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...