1132 search results - page 31 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
COMPGEOM
2010
ACM
14 years 14 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
ISLPED
1998
ACM
13 years 11 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
JCT
2010
13 years 5 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
COMBINATORICS
2000
13 years 7 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
CPM
2010
Springer
14 years 6 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...