15 search results - page 3 / 3 » cpc 2000 |
103
Voted
CPC
2000
15 years 27 days ago
2000
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
93
Voted
CPC
2000
15 years 27 days ago
2000
Abstract. For a nite multigraphG, the reliability function of G is the probability RG(q) that if each edge of G is deleted independently with probability q then the remaining edges...
116
Voted
CPC
2000
15 years 27 days ago
2000
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
85
Voted
CPC
2000
15 years 27 days ago
2000
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
97
Voted
JSYML
2000
15 years 26 days ago
2000
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...